DBScholar

Back to papers

VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning

Summary: VHP bounds LSH candidate search with a query-centered virtual hypersphere, emulated by coordinated physical hyperspheres across projections. Independent B+-trees and principled radius growth provide probabilistic c-ANN guarantees and up to 2× speedups on billion-scale data. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
he83f79a2ea0e0e4d
Venue
VLDB
Year
2020
Pagerank
0.00011016872
Overall Rank
1,325 | 91.10%
DOI
10.14778/3397230.3397240
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{lu_vldb20,
        title = {{VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning}},
        author = {Lu, Kejing and Wang, Hongya and Wang, Wei and Kudo, Mineichi},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {9},
        pages = {1443--1455},
        doi = {10.14778/3397230.3397240},
        url = {https://doi.org/10.14778/3397230.3397240},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
189 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.0002585319
803 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013838349
1,225 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00011447937
1,456 Manu: A Cloud Native Vector Database Management System 2022 VLDB 0.00010588868
1,600 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 0.00010111099
1,603 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010100279
1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.00010053127
1,681 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8836287e-05
1,979 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 9.271804e-05
3,232 Similarity Query Processing for High-Dimensional Data 2020 VLDB 7.5029541e-05
3,290 Vexless: A Serverless Vector Data Management System Using Cloud Functions 2024 SIGMOD 7.4493472e-05
4,987 LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System 2022 VLDB 6.3237807e-05
5,222 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD 6.2205593e-05
5,530 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0907372e-05
6,921 GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces 2025 VLDB 5.641565e-05
7,006 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6212001e-05
7,098 A New Sparse Data Clustering Method Based On Frequent Items 2023 SIGMOD 5.5991152e-05
7,267 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5677188e-05
7,594 Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.4865404e-05
7,600 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.4854217e-05
9,568 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.154741e-05
9,681 MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances 2023 VLDB 5.1416711e-05
10,333 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.0322912e-05
10,468 FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances 2026 SIGMOD 4.9769913e-05
10,472 GEM: A Native Graph-based Index for Multi-Vector Retrieval 2026 SIGMOD 4.9769913e-05
10,883 BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector 2026 VLDB 4.9769913e-05
12,047 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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.00045027197
278 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022310642
297 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021849337
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020600264
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016350316
576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016118297
648 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015156941
674 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00014886449
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013028642
1,481 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010535847
2,501 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 8.3781962e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0842027e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
2 338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
3 2,955 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
4 9,681 MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances 2023 VLDB
5 562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
6 927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
7 1,481 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
8 5,222 Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere 2021 SIGMOD
9 1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
10 297 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB