Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search
Summary: Isolates and accelerates the Distance Comparison Operation (DCO) in high-dimensional AKNN by proposing DADE, a data-aware, unbiased lower-dimensional distance estimator with an optimized formulation. Adds a hypothesis-testing scheme to adaptively pick minimal projection dimensions and plugs into IVF/HNSW to cut DCO-dominated latency. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Liwei Deng
- 2. Penghao Chen
- 3. Ximu Zeng
- 4. Tianfu Wang
- 5. Yan Zhao
- 6. Kai Zheng
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,042 | Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations | 2026 | SIGMOD | 4.1945683e-05 |
| 10,071 | Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search | 2026 | SIGMOD | 4.1945683e-05 |
| 10,110 | SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation | 2026 | SIGMOD | 4.1945683e-05 |
| 10,124 | TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning | 2026 | SIGMOD | 4.1945683e-05 |
| 10,237 | Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search | 2026 | VLDB | 4.1945683e-05 |
| 10,256 | I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration | 2026 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next