New dynamic construction techniques for M-tree
Journal of Discrete Algorithms
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Index support for content-based multimedia exploration
Proceedings of the international conference on Multimedia
Fully dynamic metric access methods based on hyperplane partitioning
Information Systems
Clustered pivot tables for I/O-optimized similarity search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Cut-Region: a compact building block for hierarchical metric indexing
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
DSACL+-tree: a dynamic data structure for similarity search in secondary memory
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
| Hi-index | 0.00 |
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 M-tree 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.