Bulk Loading the M-Tree
Contents
The Problem
The Approach
The M-tree
General View of an M-tree
Related Work
The BulkLoading Algorithm
A 2-D Example
Refinement Step
Refined 2-D Example
Saving Distance Computations
Experimental Results
Building Costs
Search Costs (10-NN queries)
Comparison with mvp-tree (Bozkaya and Özsoyoglu, SIGMOD '97)
Conclusions and Future Work
How to Contact the Authors
References
Author: Marco Patella
E-mail: mpatella@deis.unibo.it
Home Page: http://www-db.deis.unibo.it/~mpatella