This chapter describes several methods of similarity search, based on metric indexing, in terms of their common, underlying principles. Several approaches to creating lower bounds using the metric axioms are discussed, such as pivoting and compact partitioning with metric ball regions and generalized hyperplanes. Finally, pointers are given for further exploration of the subject, including non-metric, approximate, and parallel methods. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hetland, M. L. (2009). The basic principles of metric indexing. Studies in Computational Intelligence, 242, 199–232. https://doi.org/10.1007/978-3-642-03625-5_9
Mendeley helps you to discover research relevant for your work.