Revisiting M-tree building principles

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

Volumn 2798, Issue , 2003, Pages 148-162

  Skopal, Tomáš ^a   Pokorný, Jaroslav ^b   Krátký, Michal ^a   Snášel, Václav ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Bulk loading; M tree; Multi way insertion; Slim down algorithm

Indexed keywords

ALGORITHMS; FORESTRY;

BUILDING PRINCIPLES; BULK LOADING; DYNAMIC DATA STRUCTURE; DYNAMIC TECHNIQUES; LARGE DATASETS; M-TREE; MULTI-WAY INSERTION;

TREES (MATHEMATICS);

EID: 35248865211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39403-7_13     Document Type: Article

References (16)

1. R. Bayer. The Universal B-Tree for multidimensional indexing: General Concepts. In Proceedings of World-Wide Computing and its Applications'97, WWCA'97, Tsukuba, Japan, 1997.
2. J. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communication of the ACM, 18(9):508-517, 1975.
3. S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In Proceedings of the 22nd Intern. Conf. on VLDB, Mumbai (Bombay), India, pages 28-39. Morgan Kaufmann, 1996.
4. C. Böhm, S. Berchtold, and D. Keim. Searching in High-Dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys, 33(3):322-373, 2001.
5. T. Bozkaya and Z. M. Ozsoyoglu. Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems, 24(3):361-404, 1999.
6. P. Ciaccia and M. Patella. Bulk loading the M-tree. In Proceedings of the 9th Australian Conference (ADC'98), pages 15-26, 1998.
7. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proceedings of the 23rd Athens Intern. Conf. on VLDB, pages 426-435. Morgan Kaufmann, 1997.
8. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of ACM SIGMOD 1984, Annual Meeting, Boston, USA, pages 47-57. ACM Press, June 1984.
9. E. Navarro, R. Baeza-Yates, and J. Marroquin. Searching in Metric Spaces. ACM Computing Surveys, 33(3):273-321, 2001.
10. M. Patella. Similarity Search in Multimedia Databases. Dipartmento di Elettronica Informatica e Sistemistica, Bologna, 1999.
11. H. Samet. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16(3):184-260, 1984.
12. H. Samet. Spatial data structures in Modern Database Systems: The Object Model, Interoperability, and Beyond, pages 361-385. Addison-Wesley/ACM Press, 1995.
13. C. Traina Jr., A. Traina, B. Seeger, and C. Faloutsos. Slim-Trees: High performance metric trees minimizing overlap between nodes. Lecture Notes in Computer Science, 1777, 2000.
14. J. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Information Processing Letters, 40(4):175-179, 1991.
15. P. N. Yanilos. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In Proceedings of Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms - SODA, pages 311-321, 1993.
16. C. Yu. High-Dimensional Indexing. Springer-Verlag, LNCS 2341, 2002.