Chapter

Advances in Databases and Information Systems

Volume 2798 of the series Lecture Notes in Computer Science pp 148-162

Revisiting M-Tree Building Principles

  • Tomš SkopalAffiliated withDepartment of Computer Science, VŠB–Technical University of Ostrava
  • , Jaroslav PokornýAffiliated withDepartment of Software Engineering, Charles University
  • , Michal KrátkýAffiliated withDepartment of Computer Science, VŠB–Technical University of Ostrava
  • , Václav SnášelAffiliated withDepartment of Computer Science, VŠB–Technical University of Ostrava

* Final gross prices may vary according to local VAT.

Get Access

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