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

More documents

Recommendations

Info

162 BIBLIOGRAPHIE[86] IBM CORPORATION.OS ISAM Logic, 1966.[87] Janusz KACPRZYK et Slawomir ZADROŻNY.Computing with words in intelligent database querying: standalone and Internet-basedapplications.Information Sciences, 134:71–109, mai 2001.[88] Samuel Jerrold KAPLAN.Cooperative responses from a portable natural language database query system.Dans M. BRADY, réd., Computational Models of Discourse. MIT Press, 1982.[89] Norio KATAYAMA et Shin’ichi SATOH.The SR-Tree: an index structure for high-dimensional nearest neighbor queries.Dans Proceedings of ACM SIGMOD, Tucson, Arizona, pages 369–380, mai 1997.[90] Werner KIESSLING.Foundations of preferences in database systems.Dans Proceedings of 28th VLDB, Hong Kong, China, pages 311–322, 2002.[91] Werner KIESSLING et Gerhard KÖSTLER.Preference SQL - design, implementation, experiences.Dans Proceedings of 28th VLDB, Hong Kong, China, pages 990–1001, 2002.[92] Donald E. KNUTH.The Art of Computer Programming. Volume III: Sorting and Searching.Addison-Wesley, Reading, Massachussetts, 1973.[93] Hans-Peter KRIEGEL.Performance comparison of index structures for multi-key retrieval.Dans SIGMOD’84, Proceedings of Annual Meeting, Boston, Massachusetts, pages 186–196, juin 1984.[94] Martial LACROIX et Pierre LAVENCY.Preferences: putting more knowledge into queries.Dans Proceedings of 13th VLDB, pages 217–225, septembre 1987.[95] Laks V. S. LAKSHMANAN, Jian PEI et Jiawei HAN.Quotient Cube: how to summarize the semantics of a data cube.Dans Proceedings of VLDB, pages 778–789, 2002.[96] Henrik Legind LARSEN.An approach to flexible information access systems using soft computing.
BIBLIOGRAPHIE 163Dans Proeedings of the 32nd Hawaii International Conference on System Sciences, volume6, janvier 1999.[97] Do Heon LEE et Myoung Ho KIM.Database summarization using fuzzy ISA hierarchies.IEEE Trans. on Systems, Man and Cybernetics-Part B: Cybernetics, 27:68–78, février1997.[98] Philip L. LEHMAN et S. Bing YAO.Efficient locking for concurrent operations on B-Trees.ACM Transactions on Database Systems, 6(4):650–670, décembre 1981.[99] Wendy G. LEHNERT.A computational theory of human question answering.Dans A. JOSHI, B. WEBBER et I. SAG, réds., Elements of Discourse Understanding.Cambridge University Press, 1981.[100] King-Ip LIN, H. V. JAGADISH et Christos FALOUTSOS.The TV-Tree: an index structure for high-dimensional data.VLDB Journal, 3(4):517–542, 1994.[101] David B. LOMET et Betty SALZBERG.The hB-Tree: a multiattribute indexing method with good guaranteed performance.ACM Trans. Database Syst., 15(4):625–658, 1990.[102] Kathleen R. MCKEOWN.Generating Natural Language Text in Response to Questions about Database Queries.Thèse de doctorat, University of Pensylvannia, USA, 1981.[103] MICROSOFT CORPORATION.Description of performance options in Windows, Novembre 2006.Disponible à l’adressehttp://support.microsoft.com/kb/259025/en-us.[104] Jack MINKER.Logic and databases: a 20 year retrospective.Dans Logic in Databases, pages 3–57, 1996.Disponible à l’adresseciteseer.ist.psu.edu/minker96logic.html.[105] Jürg NIEVERGELT, Hans HINTERBERGER et Kenneth C. SEVCIK.The Grid File: an adaptable, symmetric multikey file structure.ACM Trans. Database Syst., 9(1):38–71, 1984.
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:
Page 122 and 123:
Page 124 and 125: 112 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 and 170: BIBLIOGRAPHIE 157CoBase: a scalable
Page 171 and 172: BIBLIOGRAPHIE 159ACM TODS, 4(3):315
Page 173: BIBLIOGRAPHIE 161R-trees: a dynamic
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?