The basic principles of metric indexing

  • Hetland M
  • 23


    Mendeley users who have this article in their library.
  • 19


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Magnus Lie Hetland

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free