DBScholar

Back to papers

Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces

Summary: LSH-APG combines lightweight LSH with proximity graphs to cut ANN index construction cost while preserving high-quality greedy search. Incremental insertion and cardinality-insensitive maintenance address graph-index evolution, outperforming existing graph methods empirically. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13241
Venue
VLDB
Year
2023
Pagerank
9.4561907e-05
Overall Rank
1,934 | 86.74%
DOI
10.14778/3594512.3594527

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zhao_vldb23,
        title = {{Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces}},
        author = {Zhao, Xi and Tian, Yao and Huang, Kai and Zheng, Bolong and Zhou, Xiaofang},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {8},
        pages = {1979--1991},
        doi = {10.14778/3594512.3594527},
        url = {https://doi.org/10.14778/3594512.3594527},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 34 of 34 citing papers.

Rank Citing Paper Year Venue Pagerank
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
3,335 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.5098031e-05
3,799 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.114484e-05
4,712 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.5506649e-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,133 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 5.9654376e-05
6,148 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 5.9593368e-05
6,334 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.9093559e-05
6,432 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 5.8801533e-05
6,995 Chameleon: a Heterogeneous and Disaggregated Accelerator System for Retrieval-Augmented Language Models 2025 VLDB 5.7301567e-05
7,124 GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces 2025 VLDB 5.6961208e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
7,166 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6846045e-05
9,407 RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search 2025 SIGMOD 5.2751121e-05
9,776 Fast Graph Vector Search via Hardware Acceleration and Delayed-Synchronization Traversal 2025 VLDB 5.2209769e-05
9,892 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 5.1997534e-05
9,918 HAKES: Scalable Vector Database for Embedding Search Service 2025 VLDB 5.1955087e-05
9,919 Select Edges Wisely: Monotonic Path Aware Graph Layout Optimization for Disk-based ANN Search 2025 VLDB 5.1955087e-05
10,179 Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation 2026 PODS 5.093636e-05
10,209 CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation 2026 SIGMOD 5.093636e-05
10,233 Enhancing Graph-based Approximate Maximum Inner Product Search via Norm-Adaptive Partitioning 2026 SIGMOD 5.093636e-05
10,247 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 5.093636e-05
10,251 GPS: Revisiting the Data Layout for Disk-based High-Dimensional Vector Search 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,299 Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,326 PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs 2026 SIGMOD 5.093636e-05
10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,364 Efficient Approximate Nearest Neighbor Search via Hemi-Sphere Centroids Graph 2026 SIGMOD 5.093636e-05
10,400 Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,412 TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning 2026 SIGMOD 5.093636e-05
10,435 CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,447 Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph 2026 SIGMOD 5.093636e-05
10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
11,255 Blocker and Matcher Can Mutually Benefit: A Co-Learning Framework for Low-Resource Entity Resolution 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
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
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040719947
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
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,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
11,671 MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces 2021 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers