Revisiting M-tree Building Principles.

Abstrakt

We introduce two new dynamic techniques of building 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.