Le resume linguistique de donnees structurees comme ... - APMD

More documents

Recommendations

Info

158 BIBLIOGRAPHIEInformation Sciences, 121(3-4):233–270, 1999.[47] Frédéric CUPPENS et Robert DEMOLOMBE.Cooperative answering: a methodology to provide intelligent access to databases.Dans Proceedings of the 2nd International Conference on Expert Database Systems,pages 621–643, 1988.[48] Chris J. DATE.An introduction to database systems.Addison-Wesley, 6è édition, novembre 1994.[49] Chris J. DATE.Introduction aux bases de données.Ed. Vuibert Informatique, 7è édition, décembre 2000.[50] Robert DEMOLOMBE.Abstract objects to represent large answers to queries in a concise form.Dans Proceedings of FQAS 2000, pages 171–181, octobre 2000.[51] Didier DUBOIS et Henri PRADE.Using fuzzy sets in database systems: why and how ?Dans Proceedings of the 1996 Workshop on Flexible Query-Answering Systems, pages89–103, Roskilde, Denmark, mai 1996.[52] Didier DUBOIS et Henri PRADE.The three semantics of fuzzy sets.Fuzzy Sets and Systems, 90:141–150, 1997.[53] Didier DUBOIS et Henri PRADE.Fuzzy sets in data summaries — outline of a new approach.Dans Proc. 8th International Conference on Information Processing and Managementof Uncertainty in Knowledge-based Systems (IPMU’2000), volume 2, pages 1035–1040, juillet 2000.[54] Pierre DUHAMEL et Martin VETTERLI.Fast Fourier Transforms: a tutorial review and a state of the art.Signal Processing, 19(4):259–299, 1990.[55] Brians S. EVERITT, Sabine LANDAU et Morven LEESE.Cluster analysis.Hodder Arnold, London, 4è édition, 2001.[56] Ronald FAGIN, Jurg NIEVERGELT, Nicholas PIPPENGER et H. Raymond STRONG.Extendible hashing – a fast access method for dynamic files.
BIBLIOGRAPHIE 159ACM TODS, 4(3):315–344, septembre 1979.[57] Li FAN, Pei CAO, Jussara ALMEIDA et Andrei Z. BRODER.Summary cache: a scalable wide-area Web cache sharing protocol.IEEE/ACM Transactions on Networking, 8(3):281–293, 2000.Disponible à l’adresseciteseer.ist.psu.edu/fan98summary.html.[58] Ephraim FEIG et Shmuel WINOGRAD.Fast algorithms for the discrete cosine transform.IEEE Transactions on Signal Processing, 40(9):2174–2193, 1992.[59] Josef FINK et Alfred KOBSA.A review and analysis of commercial user modeling servers for personalization on theworld wide web.User Model. User-Adapt. Interact., 10(2-3):209–249, 2000.[60] Michael FREESTON.The BANG file: a new kind of grid file.Dans Proceedings of ACM SIGMOD, pages 260–269, 1987.[61] Michael FREESTON.A general solution of the n-dimensional B-Tree problem.Dans Proceedings of ACM SIGMOD, San Jose, California, pages 81–90, mai 1995.[62] Henry FUCHS, Gregory D. ABRAM et Eric D. GRANT.Near real-time shaded display of rigid objects.Computer Graphics, 17(3):65–72, juillet 1983.[63] Henry FUCHS, Zvi M. KEDEM et Bruce F. NAYLOR.On visible surface generation by a priori tree structures.ACM Computer Graphics, 14(3):124–133, juillet 1980.[64] Terry GAASTERLAND, Parke GODFREY et Jack MINKER.An overview of cooperative answering.Journal of Intelligent Systems, 1(2):123–157, 1992.[65] Terry GAASTERLAND, Parke GODFREY, Jack MINKER et Lev NOVIK.Cooperative answers in database systems.http://citeseer.ist.psu.edu/50363.html.[66] Terry GAASTERLAND, Parke GODFREY, Jack MINKER et Lev NOVIK.A cooperative answering system.Dans LPAR, pages 478–480, 1992.
Page 1:
École Centrale de Nantes Universit
Page 5:
W. Amenel Abraham VOGLOZINLe résum
Page 9:
RemerciementsMes remerciements vont
Page 13 and 14:
IntroductionProblématique, motivat
Page 15 and 16:
Introduction 3du modèle SAINTETIQ,
Page 17:
Introduction 5structure d’index b
Page 20 and 21:
8 CHAPITRE 1 — Les résumés du m
Page 22 and 23:
10 CHAPITRE 1 — Les résumés du
Page 24 and 25:
Page 26 and 27:
Page 28:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
28 CHAPITRE 2 — Algorithme d’in
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
44 CHAPITRE 3 — Interrogation fle
Page 58 and 59:
Page 60:
Page 65 and 66:
CHAPITRE 3 — Interrogation flexib
Page 67 and 68:
Page 69 and 70:
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
CHAPITRE 4Application des résumés
Page 77 and 78:
CHAPITRE 4 — Application des rés
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101:
Page 104 and 105:
92 CHAPITRE 5 — Indexation de don
Page 106 and 107:
Page 108 and 109:
Page 110 and 111:
Page 112 and 113:
100 CHAPITRE 5 — Indexation de do
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121: 108 CHAPITRE 5 — Indexation de do
Page 140 and 141: 128 CHAPITRE 6 — Implémentation
Page 161 and 162: Conclusion généraleRésuméDurant
Page 163 and 164: Conclusion générale 151tinence vi
Page 165 and 166: Bibliographie[1] Paul M. AOKI.Gener
Page 167 and 168: BIBLIOGRAPHIE 155Dans Proceedings o
Page 169: BIBLIOGRAPHIE 157CoBase: a scalable
Page 173 and 174: BIBLIOGRAPHIE 161R-trees: a dynamic
Page 175 and 176: BIBLIOGRAPHIE 163Dans Proeedings of
Page 177 and 178: BIBLIOGRAPHIE 165Thèse de doctorat
Page 179 and 180: BIBLIOGRAPHIE 167[135] THE POSTGRES
Page 181: BIBLIOGRAPHIE 169Information and Co
Page 185 and 186: Liste des figures—Corps du docume
Page 187 and 188: Table des matières—Corps du docu
Page 189 and 190: TABLE DES MATIÈRES 1775 Indexation
Page 192: Le résumé linguistique de donnée
show all

Le resume linguistique de donnees structurees comme ... - APMD

Create successful ePaper yourself

Delete template?

Save as template?