Abstract

We introduce a dynamic and secondary-memory-based variant of the List of Clusters, which is shown to be competitive with the literature, especially on higher-dimensional spaces, where it outperforms the M-tree in searches and I/Os used for insertions. The basic principles of our design are applicable to other secondary-memory structures.