DBScholar

Back to papers

Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations

Summary: Shows estimation-and-testing DCOs become costly under SIMD and best-first search forces many redundant DCOs. SkipComputing uses subspace-based candidate filtering, distance-decomposition lower bounds, and layout tweaks to skip redundant SIMD DCOs, achieving up to 6× vs HNSW and 2.7× vs SOTA. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
hcba1211e9aa94b13
Venue
SIGMOD
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,540 | 29.14%
DOI
10.1145/3769753

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{song_sigmod26,
        title = {{Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations}},
        author = {Song, Ziwen and Wang, Bin and Yang, Xiaochun},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769753},
        url = {https://dl.acm.org/doi/10.1145/3769753},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 29 of 29 cited papers.

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

Rank Cited Paper Year Venue Pagerank
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040370171
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
194 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00025636725
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
713 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00014571977
804 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013832333
839 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013547412
916 PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension 2020 SIGMOD 0.00013094482
1,170 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.0001171991
1,462 Manu: A Cloud Native Vector Database Management System 2022 VLDB 0.0001058099
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,613 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010072237
1,684 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8801753e-05
2,060 Similarity search in the blink of an eye with compressed indices 2023 VLDB 9.0983169e-05
2,871 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9229231e-05
3,230 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5056037e-05
3,290 Vexless: A Serverless Vector Data Management System Using Cloud Functions 2024 SIGMOD 7.4528093e-05
3,325 Efficient k-NN Search on Vertically Decomposed Data 2002 SIGMOD 7.4271038e-05
3,385 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.3548612e-05
6,239 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 5.8382662e-05
7,004 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6238624e-05
7,804 PDX: A Data Layout for Vector Similarity Search 2025 SIGMOD 5.4502168e-05
9,136 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2224279e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 7,004 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD
2 1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
3 74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB
4 10,326 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD
5 10,827 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB
6 839 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD
7 7,264 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD
8 10,078 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB
9 1,601 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD
10 6,239 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB