Back to papers
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning
Summary: VHP introduces virtual hypersphere partitioning to bound c-ANN search space in high dimensions, with isotropic hyperspheres centered at the query. Disk-based indexing stores LSH projections in independent B+-trees; radii expand until a target success probability is met, with formal guarantees for any c ≥ 1 and up to 2× speedups on billion-scale datasets.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12054
- Venue
- VLDB
- Year
- 2020
- Pagerank
- 0.00010660932
- Overall Rank
- 1,757 | 87.78%
- DOI
-
10.14778/3397230.3397240
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 495 |
Milvus: A Purpose-Built Vector Data Management System |
2021 |
SIGMOD |
0.00021767688 |
| 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,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,971 |
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces |
2023 |
VLDB |
7.7970531e-05 |
| 3,680 |
SingleStore-V: An Integrated Vector Database System in SingleStore |
2024 |
VLDB |
6.8496415e-05 |
| 4,278 |
Similarity Query Processing for High-Dimensional Data |
2020 |
VLDB |
6.2953764e-05 |
| 4,862 |
Vexless: A Serverless Vector Data Management System Using Cloud Functions |
2024 |
SIGMOD |
5.8707776e-05 |
| 5,456 |
Point-to-Hyperplane Nearest Neighbor Search Beyond the Unit Hypersphere |
2021 |
SIGMOD |
5.4976692e-05 |
| 5,551 |
LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System |
2022 |
VLDB |
5.4421769e-05 |
| 5,996 |
A New Sparse Data Clustering Method Based On Frequent Items |
2023 |
SIGMOD |
5.2415551e-05 |
| 6,376 |
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search |
2024 |
VLDB |
5.0916875e-05 |
| 7,837 |
GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces |
2025 |
VLDB |
4.6379694e-05 |
| 7,843 |
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
4.6367909e-05 |
| 8,439 |
Accelerating Graph Indexing for ANNS on Modern CPUs |
2025 |
SIGMOD |
4.5128946e-05 |
| 8,497 |
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph |
2025 |
SIGMOD |
4.4981377e-05 |
| 9,303 |
MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances |
2023 |
VLDB |
4.358026e-05 |
| 10,111 |
Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,154 |
Distribution-Aware Exploration for Adaptive HNSW Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,165 |
Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 11,541 |
Fast Algorithm for Anchor Graph Hashing |
2021 |
VLDB |
4.1945683e-05 |
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.
Semantically Similar Papers