Synonyms
Definition
Metric space indexing is closely related to the recent digitization revolution where almost everything that one can see, hear, read, write or measure is available in digital form. Unlike traditional attribute-like data types such as numbers and strings of sortable domains, instances of these new data types are complex, and the only measure of comparison to apply is a sort of similarity. Such a situation implies an application of the query-by-example search paradigm where the database is searched for objects that are near the example object, also called the query object. A useful abstraction of this similarity is to see it as mathematical metric space [7]. The problem of organizing and searching large datasets of complex objects can then be considered from the perspective of generic or arbitrary metric spaces, sometimes labeled distance spaces. In general, the search problem can be described as follows:
Let D be a domain, d a distance measure on D, and...
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Recommended Reading
Batko M, Novak D, Falchi F, Zezula P. On scalability of the similarity search in the world of peers. In: Proceedings of 1st International Conference Scalable Information Systems; 2006. p. 1–12.
Chávez E, Navarro G, Baeza-Yates R, Marroquín JL. Searching in metric spaces. ACM Comput Surv. 2001;33(3):273–321.
Ciaccia P, Patella M, Zezula P. M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of 23th International Conference on Very Large Data Bases; 1997. p. 426–35.
Dohnal V, Gennaro C, Savino P, Zezula P. D-Index: distance searching index for metric data sets. Multimedia Tools Appl. 2003;21(1):9–33.
Hjaltason GR, Samet H. Incremental similarity search in multimedia databases. Technical Report CS-TR-4199, Computer Science Department, University of Maryland, College Park; Nov 2000.
Hjaltason GR, Samet H. Index-driven similarity search in metric spaces. ACM Trans Database Syst. 2003;28(4):517–80.
Kelly JL. General topology. New York: D. Van Nostrand; 1955.
Samet H. Foundations of multidimensional and metric data structures. San Francisco: Morgan Kaufmann; 2005.
Traina Jr C, Traina AJM, Seeger B, Faloutsos C. Slim-trees: high performance metric trees minimizing overlap between nodes. In: Advances in Database Technology, Proceedings of 7th International Conference on Extending Database Technology; 2000. p. 51–65.
Zezula P, Amato G, Dohnal V, Batko M. Similarity search: the metric space approach. Berlin: Springer; 2006.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this entry
Cite this entry
Zezula, P., Batko, M., Dohnal, V. (2014). Indexing Metric Spaces. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_199-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_199-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering