On Reinsertions in M-tree

In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from the leaf (reducing the covering radius), and then again inserted into the M-tree in a usual way. A regular leaf split is performed only after a series of unsuccessful reinsertion attempts. We expect the forced reinsertions will result in more compact Mtree hierarchies (i.e., more efficient query processing), while the index construction costs should be kept as low as possible. Considering both low construction costs and low querying costs, we examine several combinations of construction policies with reinsertions. The experiments show that forced reinsertions could significantly decrease the number of distance computations, thus speeding up indexing as well as querying.

• Type: Conference
• Year: 2008
• Where: SISAP
• Authors: Jakub Lokoc, Tomás Skopal
• Keywords: Construction Costs, Data Mining, Forced Reinsertions, Regular Leaf Split, SISAP 2008