Revisiting M-Tree Building Principles

  • Tomš Skopal
  • Jaroslav Pokorný
  • Michal Krátký
  • Václav Snášel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2798)

Abstract

The M-tree is a dynamic data structure designed to index metric datasets. In this paper we introduce two dynamic techniques of building the M-tree. The first one incorporates a multi-way object insertion while the second one exploits the generalized slim-down algorithm. Usage of these techniques or even combination of them significantly increases the querying performance of the M-tree. We also present comparative experimental results on large datasets showing that the new techniques outperform by far even the static bulk loading algorithm.

Keywords

M-tree bulk loading multi-way insertion slim-down algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bayer, R.: The Universal B-Tree for multidimensional indexing: General Concepts. In: Masuda, T., Tsukamoto, M., Masunaga, Y. (eds.) WWCA 1997. LNCS, vol. 1274. Springer, Heidelberg (1997)Google Scholar
  2. 2.
    Bentley, J.: Multidimensional Binary Search Trees Used for Associative Searching. Communication of the ACM 18(9), 508–517 (1975)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Berchtold, S., Keim, D., Kriegel, H.-P.: The X-tree: An Index Structure for High- Dimensional Data. In: Proceedings of the 22nd Intern. Conf. on VLDB, Mumbai (Bombay), India, pp. 28–39. Morgan Kaufmann, San Francisco (1996)Google Scholar
  4. 4.
    Böhm, C., Berchtold, S., Keim, D.: Searching in High-Dimensional Spaces – Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys 33(3), 322–373 (2001)CrossRefGoogle Scholar
  5. 5.
    Bozkaya, T., Ozsoyoglu, Z.M.: Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems 24(3), 361–404 (1999)CrossRefGoogle Scholar
  6. 6.
    Ciaccia, P., Patella, M.: Bulk loading the M-tree. In: Proceedings of the 9th Australian Conference (ADC 1998), pp. 15–26 (1998)Google Scholar
  7. 7.
    Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: Proceedings of the 23rd Athens Intern. Conf. on VLDB, pp. 426–435. Morgan Kaufmann, San Francisco (1997)Google Scholar
  8. 8.
    Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings of ACM SIGMOD 1984, Annual Meeting, Boston, USA, June 1984, pp. 47–57. ACM Press, New York (1984)CrossRefGoogle Scholar
  9. 9.
    Navarro, E., Baeza-Yates, R., Marroquin, J.: Searching in Metric Spaces. ACM Computing Surveys 33(3), 273–321 (2001)CrossRefGoogle Scholar
  10. 10.
    Patella, M.: Similarity Search in Multimedia Databases. Dipartmento di Elettronica Informatica e Sistemistica, Bologna (1999)Google Scholar
  11. 11.
    Samet, H.: The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys 16(3), 184–260 (1984)Google Scholar
  12. 12.
    Samet, H.: Spatial data structures in Modern Database Systems: The Object Model, Interoperability, and Beyond, pp. 361–385. Addison-Wesley/ACM Press (1995)Google Scholar
  13. 13.
    Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-trees: High performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, p. 51. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  14. 14.
    Uhlmann, J.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40(4), 175–179 (1991)MATHCrossRefGoogle Scholar
  15. 15.
    Yanilos, P.N.: 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, pp. 311–321 (1993)Google Scholar
  16. 16.
    Yu, C.: High-dimensional indexing. In: Yu, C. (ed.) High-Dimensional Indexing. LNCS, vol. 2341, pp. 9–35. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tomš Skopal
    • 1
  • Jaroslav Pokorný
    • 2
  • Michal Krátký
    • 1
  • Václav Snášel
    • 1
  1. 1.Department of Computer ScienceVŠB–Technical University of OstravaCzech Republic
  2. 2.Department of Software EngineeringCharles UniversityPragueCzech Republic

Personalised recommendations