Back to papers
Accelerating Graph Indexing for ANNS on Modern CPUs
Summary: Graph-based ANNS indexing (e.g., HNSW) is CPU-bound by distance computations and random memory accesses; Flash is a compact coding strategy optimized for modern CPUs to boost SIMD and cache locality in graph indexing. It delivers 10.4x–22.9x faster index construction on 10M–1B vectors across eight datasets, with equal or improved search performance.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7198
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.5128946e-05
- Overall Rank
- 8,439 | 41.30%
- DOI
-
10.1145/3725260
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
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 |
| 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 |
| 736 |
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data |
2020 |
VLDB |
0.00017447617 |
| 770 |
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search |
2021 |
VLDB |
0.00016917602 |
| 1,010 |
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces |
2018 |
VLDB |
0.00014652858 |
| 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,757 |
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning |
2020 |
VLDB |
0.00010660932 |
| 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,523 |
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data |
2024 |
SIGMOD |
8.604576e-05 |
| 2,677 |
HET: Scaling out Huge Embedding Model Training via Cache-enabled Distributed Framework |
2022 |
VLDB |
8.3268401e-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 |
| 2,870 |
Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing |
2013 |
VLDB |
7.9799783e-05 |
| 2,971 |
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces |
2023 |
VLDB |
7.7970531e-05 |
| 3,225 |
DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search |
2020 |
VLDB |
7.3463484e-05 |
| 3,400 |
ELPIS: Graph-Based Similarity Search for Scalable Data Science |
2023 |
VLDB |
7.1405533e-05 |
| 3,609 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9215236e-05 |
| 3,624 |
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
6.9056e-05 |
| 3,680 |
SingleStore-V: An Integrated Vector Database System in SingleStore |
2024 |
VLDB |
6.8496415e-05 |
| 5,233 |
RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search |
2024 |
VLDB |
5.6131833e-05 |
| 5,551 |
LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System |
2022 |
VLDB |
5.4421769e-05 |
| 5,707 |
FARGO: Fast Maximum Inner Product Search via Global Multi-Probing |
2023 |
VLDB |
5.3611041e-05 |
| 7,832 |
LIDER: An Efficient High-dimensional Learned Index for Large-scale Dense Passage Retrieval |
2023 |
VLDB |
4.6387029e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,166 |
FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 2,971 |
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces |
2023 |
VLDB |
7.7970531e-05 |
| 10,160 |
Efficient Vector Index Merging in Vector Databases |
2026 |
SIGMOD |
4.1945683e-05 |
| 8,209 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
4.5581054e-05 |
| 3,609 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9215236e-05 |
| 10,111 |
Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,760 |
Turbocharging Vector Databases using Modern SSDs |
2025 |
VLDB |
4.1945683e-05 |
| 10,683 |
Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts |
2025 |
VLDB |
4.1945683e-05 |
| 7,301 |
Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search |
2018 |
SIGMOD |
4.768971e-05 |
| 10,167 |
FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity Search |
2026 |
SIGMOD |
4.1945683e-05 |