DBScholar

Back to papers

Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search

Summary: Subspace Collision (SC) yields theoretical guarantees for high-d ANN via SC-score, a Pareto-distance proxy, and SuCo's clustering-based, lightweight index. Experiments show 1-2 orders of magnitude faster queries with <=1/10 memory, beating guarantee-enabled baselines. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7132
Venue
SIGMOD
Year
2025
Pagerank
5.6908957e-05
Overall Rank
7,145 | 50.98%
DOI
10.1145/3709729

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wei_sigmod25,
        title = {{Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search}},
        author = {Wei, Jiuqi and Lee, Xiaodong and Liao, Zhenyu and Palpanas, Themis and Peng, Botao},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709729},
        url = {https://dl.acm.org/doi/10.1145/3709729},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
6,615 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 5.8214312e-05
9,360 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2819088e-05
10,193 An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,297 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,544 I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration 2026 VLDB 5.093636e-05
10,578 ConANN: Conformal Approximate Nearest Neighbor Search 2026 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 31 of 31 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
46 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044853085
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016153395
990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00012796562
1,084 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012256753
1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011508159
1,430 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.0001080902
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
1,735 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 9.9004924e-05
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-05
2,158 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0622995e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-05
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
3,240 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.6071649e-05
3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.5711218e-05
3,486 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.3696676e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
4,883 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.4648124e-05
5,231 Hercules Against Data Series Similarity Search 2022 VLDB 6.3068064e-05
5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0850924e-05
6,148 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 5.9593368e-05
6,691 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.8011086e-05
9,278 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.2936898e-05
9,377 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.2755515e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 1,137 A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space 1997 PODS
2 398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB
3 1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD
4 1,735 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD
5 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
6 580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
7 10,336 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD
8 10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD
9 10,364 Efficient Approximate Nearest Neighbor Search via Hemi-Sphere Centroids Graph 2026 SIGMOD
10 10,297 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD