Revisiting M-Tree Building Principles
- 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
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.
KeywordsM-tree bulk loading multi-way insertion slim-down algorithm
Unable to display preview. Download preview PDF.