Efficient bulk loading of large high-dimensional indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1676, Issue , 1999, Pages 251-260

  Böhm, Christian ^a   Kriegel, Hans Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; DIGITAL STORAGE; QUERY PROCESSING; WAREHOUSES;

DISCOVERY ALGORITHM; HIGH-DIMENSIONAL; INDEX CONSTRUCTION; INDEX PROPERTIES; MULTIDIMENSIONAL DATA; PERFORMANCE GAIN; RUN TIME COMPLEXITY; SECONDARY STORAGE;

ALGORITHMS;

EID: 84958060788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48298-9_27     Document Type: Conference Paper

References (17)

1. Böhm, Braunmüller, Breunig, Kriegel: ‘Fast Clustering Using High-Dimensional Similarity Joins’, submitted for publication, 1999.
2. Berchtold, Böhm, Jagadish, Kriegel, Sander: ‘Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces’, submitted for publication, 1999.
3. Berchtold, Böhm, Kriegel: ‘Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations’, Int. Conf. on Extending Database Techn., EDBT, 1998.
4. Berchtold, Böhm, Keim, Kriegel: ‘A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space’, ACM PODS Symp. Principles of Database Systems, 1997.
5. Böhm, Kriegel: ‘Dynamically Optimizing High-Dimensional Index Structures’, subm., 1999.
6. Berchtold, Keim, Kriegel: ‘The X-Tree: An Index Structure for High-Dimensional Data’, Int. Conf. on Very Large Data Bases, VLDB, 1996.
7. van den Bercken, Seeger, Widmayer:‘A General Approach to Bulk Loading Multidimensional Index Structures’, Int. Conf. on Very Large Databases, VLDB, 1997.
8. Böhm: ‘Efficiently Indexing High-Dimensional Data Spaces’, PhD Thesis, University of Munich, Herbert Utz Verlag, 1998.
9. Ester, Kriegel, Sander, Xu: ‘A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise’, Int. Conf. Knowl. Disc. and Data Mining, KDD, 1996.
10. Hoare: ‘Quicksort’, Computer Journal, Vol. 5, No. 1, 1962.
11. Jain, Dubes: ‘Algorithms for Clustering Data’, Prentice-Hall, Inc., 1988.
12. Jain, White: ‘Similarity Indexing: Algorithms and Performance’, SPIE Storage and Retrieval for Image and Video Databases IV, Vol. 2670, 1996.
13. Kamel, Faloutsos: ‘Hilbert R-tree: An Improved R-tree using Fractals’. Int. Conf. on Very Large Data Bases, VLDB, 1994.
14. Kaufman, Rousseeuw: ‘Finding Groups in Data: An Introduction to Cluster Analysis’, John Wiley & Sons, 1990.
15. Ng, Han: ‘Efficient and Effective Clustering Methods for Spatial Data Mining’, Int. Conf. On Very Large Data Bases, VLDB, 1994.
16. Sedgewick: ‘Quicksort’, Garland, New York, 1978.
17. Weber, Schek, Blott: ‘A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces’, Int. Conf. on Very Large Databases, VLDB, 1998.