Static-to-Dynamic Transformation for Metric Indexing Structures

  • Bilegsaikhan Naidan
  • Magnus Lie Hetland
Conference paper

DOI: 10.1007/978-3-642-32153-5_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7404)
Cite this paper as:
Naidan B., Hetland M.L. (2012) Static-to-Dynamic Transformation for Metric Indexing Structures. In: Navarro G., Pestov V. (eds) Similarity Search and Applications. SISAP 2012. Lecture Notes in Computer Science, vol 7404. Springer, Berlin, Heidelberg

Abstract

In this paper, we study the well-known algorithm of Bentley and Saxe in the context of similarity search in metric spaces. We apply the algorithm to existing static metric index structures, obtaining dynamic ones. We show that the overhead of the Bentley-Saxe method is quite low, and because it facilitates the dynamic use of any state-of-the-art static index method, we can achieve results comparable to, or even surpassing, existing dynamic methods. Another important contribution of our approach is that it is very simple—an important practical consideration. Rather than dealing with the complexities of dynamic tree structures, for example, the core index can be built statically, with full knowledge of its data set.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Bilegsaikhan Naidan
    • 1
  • Magnus Lie Hetland
    • 1
  1. 1.Department of Computer and Information ScienceNorwegian University of Science and TechnologyTrondheimNorway

Personalised recommendations