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
- 7349
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,042 | 30.14%
- DOI
-
10.1145/3769753
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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 |
| 79 |
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces |
1998 |
VLDB |
0.00056242144 |
| 91 |
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces |
1997 |
VLDB |
0.0005181666 |
| 212 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00033913475 |
| 495 |
Milvus: A Purpose-Built Vector Data Management System |
2021 |
SIGMOD |
0.00021767688 |
| 562 |
Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search |
2016 |
VLDB |
0.00020091752 |
| 605 |
Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting |
2012 |
SIGMOD |
0.000193396 |
| 682 |
Quality and Efficiency in High Dimensional Nearest Neighbor Search |
2009 |
SIGMOD |
0.00018201541 |
| 770 |
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search |
2021 |
VLDB |
0.00016917602 |
| 867 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015792021 |
| 1,269 |
Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan |
2016 |
VLDB |
0.00012930432 |
| 1,364 |
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination |
2020 |
SIGMOD |
0.00012370117 |
| 1,636 |
PASE: PostgreSQL Ultra-High-Dimensional Approximate Nearest Neighbor Search Extension |
2020 |
SIGMOD |
0.00011053863 |
| 1,971 |
LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index |
2016 |
SIGMOD |
9.893198e-05 |
| 2,023 |
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases |
2023 |
SIGMOD |
9.7544991e-05 |
| 2,262 |
Manu: A Cloud Native Vector Database Management System |
2022 |
VLDB |
9.1624446e-05 |
| 2,324 |
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
9.0326444e-05 |
| 2,690 |
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment |
2024 |
SIGMOD |
8.293714e-05 |
| 2,725 |
HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search |
2022 |
VLDB |
8.2294908e-05 |
| 2,811 |
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations |
2023 |
SIGMOD |
8.0806307e-05 |
| 3,579 |
Efficient k-NN Search on Vertically Decomposed Data |
2002 |
SIGMOD |
6.9502303e-05 |
| 3,609 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9215236e-05 |
| 4,278 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
6.2953764e-05 |
| 4,731 |
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art |
2025 |
SIGMOD |
5.966659e-05 |
| 4,862 |
Vexless: A Serverless Vector Data Management System Using Cloud Functions |
2024 |
SIGMOD |
5.8707776e-05 |
| 5,184 |
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
5.6406991e-05 |
| 7,239 |
Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search |
2025 |
VLDB |
4.792836e-05 |
| 7,879 |
PDX: A Data Layout for Vector Similarity Search |
2025 |
SIGMOD |
4.6292417e-05 |
| 8,439 |
Accelerating Graph Indexing for ANNS on Modern CPUs |
2025 |
SIGMOD |
4.5128946e-05 |
| 9,291 |
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.3619549e-05 |
Semantically Similar Papers