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
hf90fac99a572dedd
Venue
SIGMOD
Year
2025
Pagerank
5.5703557e-05
Overall Rank
7,264 | 51.17%
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.

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
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020445545
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016121388
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013025904
1,095 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012050625
1,170 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.0001171991
1,328 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011003106
1,485 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010523759
1,530 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010344205
1,601 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 0.00010103316
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
1,684 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8801753e-05
2,113 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0196806e-05
2,265 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7238222e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0861221e-05
2,871 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9229231e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.2438813e-05
4,598 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.5086378e-05
4,680 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4722037e-05
4,986 Indexing for Interactive Exploration of Big Data Series 2014 SIGMOD 6.3264608e-05
5,313 Hercules Against Data Series Similarity Search 2022 VLDB 6.1846986e-05
5,527 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0936219e-05
6,609 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7354155e-05
9,440 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.1771634e-05
9,563 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.1571823e-05
Previous Page 1 / 1 Next

Semantically Similar Papers