Built independently by an author, for readers. Read the story and support ChapterPal
ChapterPal Logo
Log inSign up

keyword

spatial database systems

A spatial database system is a specialized database management system designed to store, manage, and query data representing objects defined in geometric or multi-dimensional spaces. Unlike conventional databases optimized for standard alphanumeric records, a spatial database system provides native spatial data types, such as points, lines, polygons, and vector representations, along with dedicated spatial indexing structures like R-trees, quadtrees, and space-partitioning schemes. These systems feature specialized query processing engines capable of efficiently executing geometric computations and spatial predicates, including range searches, spatial joins, topological relationship tests, and nearest-neighbor or similarity queries. By managing complex spatial relationships and high-dimensional coordinate data, spatial database systems support applications such as geographic information systems, computer-aided design, multimedia retrieval, and spatial data analytics.

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