Revisiting M-Tree Building Principles

  • Tomš Skopal
  • Jaroslav Pokorný
  • Michal Krátký
  • Václav Snášel
Conference paper

DOI: 10.1007/978-3-540-39403-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2798)
Cite this paper as:
Skopal T., Pokorný J., Krátký M., Snášel V. (2003) Revisiting M-Tree Building Principles. In: Kalinichenko L., Manthey R., Thalheim B., Wloka U. (eds) Advances in Databases and Information Systems. ADBIS 2003. Lecture Notes in Computer Science, vol 2798. Springer, Berlin, Heidelberg

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.

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