Searching in high-dimensional spaces

Article Properties
  • Language
    English
  • Publication Date
    2001/09/01
  • Indian UGC (Journal)
  • Refrences
    124
  • Citations
    244
  • Christian Böhm University of Munich, München, Germany
  • Stefan Berchtold stb ag, Germany, Augsburg, Germany
  • Daniel A. Keim AT&T Research Labs and University of Constance, Konstanz, Germany
Abstract
Cite
Böhm, Christian, et al. “Searching in High-Dimensional Spaces”. ACM Computing Surveys, vol. 33, no. 3, 2001, pp. 322-73, https://doi.org/10.1145/502807.502809.
Böhm, C., Berchtold, S., & Keim, D. A. (2001). Searching in high-dimensional spaces. ACM Computing Surveys, 33(3), 322-373. https://doi.org/10.1145/502807.502809
Böhm C, Berchtold S, Keim DA. Searching in high-dimensional spaces. ACM Computing Surveys. 2001;33(3):322-73.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Description

Can multimedia databases handle the growing demand for efficient content-based retrieval? This survey examines the challenges and solutions for similarity searches in high-dimensional spaces, a key component of multimedia database systems. The paper reviews various index structures and algorithms designed to enhance query processing in these complex environments. As multimedia data becomes increasingly prevalent in fields like medicine, CAD, and geography, content-based retrieval has emerged as a critical functionality. The survey explores how feature transformations are used to convert multimedia object properties into high-dimensional feature vectors, effectively transforming similarity searches into proximity searches in the feature space. It highlights the significant performance improvements achieved by new index structures and algorithms. This overview provides valuable insights into the state-of-the-art techniques for querying multimedia databases. By addressing the inherent problems of processing queries in high-dimensional spaces, the described approaches pave the way for more efficient and scalable multimedia information retrieval systems, enabling users to quickly and accurately find similar objects within large databases. These advancements have significant implications for various multimedia applications and data-driven research.

Published in ACM Computing Surveys, this work fits perfectly with the journal's scope of providing comprehensive overviews of important topics in computer science. By surveying the current state of similarity search techniques in high-dimensional spaces, this paper serves as a valuable resource for researchers and practitioners in the field, aligning with the journal’s goal of promoting knowledge dissemination and advancement in computing.

Refrences
Citations
Citations Analysis
The first research to cite this article was titled Searching in metric spaces and was published in 2001. The most recent citation comes from a 2024 study titled Searching in metric spaces . This article reached its peak citation in 2008 , with 23 citations.It has been cited in 126 different journals, 8% of which are open access. Among related journals, the IEEE Transactions on Knowledge and Data Engineering cited this research the most, with 17 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year