Built independently by an author, for readers. Read the story and support ChapterPal

keyword

high-dimensional spaces

High-dimensional spaces are mathematical vector spaces characterized by a large number of coordinate axes or dimensions, where each data point is represented by a vector of numerous independent features or variables. While physical space is limited to three dimensions, high-dimensional spaces extend this framework to tens, hundreds, or thousands of dimensions to model complex real-world data such as images, text embeddings, and multi-attribute records. As the number of dimensions increases, geometric intuition breaks down and the space becomes extremely sparse, with data points drifting toward the outer boundaries and pairwise distances tending to become nearly uniform. These counterintuitive properties give rise to the curse of dimensionality, which makes fundamental computational operations like spatial partitioning, nearest-neighbor searching, and clustering increasingly difficult and resource-intensive compared to low-dimensional environments.

1 item

A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

Roger Weber, Hans-J. Schek, Stephen Blott

OrganizationsBell LaboratoriesETH ZurichInstitute of Information Systems

Why you should read this

Proves that conventional tree-based indexing structures degenerate into linear scans beyond ten dimensions and introduces the Vector Approximation File to dramatically accelerate similarity search in high-dimensional vector spaces.

For similarity search in high-dimensional vector spaces (or ‘HDVSs’), researchers have proposed a number of new methods (or adaptations of existing methods) based, in the main, on data-space partitioning. However, the performance of these methods generally degrades as dimensionality increases. Although this phenomenon—known as the ‘dimensional curse’ is well known, little or no quantitative analysis of the phenomenon is available. In this paper, we provide a detailed analysis of partitioning and clustering techniques for similarity search in HDVSs. We show formally that these methods exhibit linear complexity at high dimensionality, and that existing methods are outperformed on average by a simple sequential scan if the number of dimensions exceeds around 10. Consequently, we come up with an alternative organization based on approximations to make the unavoidable sequential scan as fast as possible. We describe a simple vector approximation scheme, called VA-file, and report on an experimental evaluation of this and of two tree-based index methods (an R*-tree and an X-tree).

Added

2026-09-18