Back to papers
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search
Summary: DET-LSH introduces DE-Tree, an encoding-based index that avoids expensive space partitioning to speed up indexing and support Euclidean range queries. It issues range queries across multiple independent DE-Trees to reduce missed NNs, with probabilistic guarantees and up to 6× indexing / 2× query speedups.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13455
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 5.0868008e-05
- Overall Rank
- 6,375 | 55.70%
- DOI
-
10.14778/3665844.3665854
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 7,307 |
Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes |
2024 |
VLDB |
4.7623207e-05 |
| 7,848 |
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
4.6323445e-05 |
| 8,418 |
DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter |
2025 |
SIGMOD |
4.5119865e-05 |
| 9,233 |
LeaFi: Data Series Indexes on Steroids with Learned Filters |
2025 |
SIGMOD |
4.3648789e-05 |
| 9,296 |
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.3577746e-05 |
| 10,071 |
Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,129 |
WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,165 |
Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,204 |
Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,222 |
RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference |
2026 |
VLDB |
4.1905499e-05 |
| 10,691 |
Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts |
2025 |
VLDB |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 28 of 28 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.0032118946 |
| 6 |
The R*-tree: An Efficient and Robust Access Method for Points and Rectangles |
1990 |
SIGMOD |
0.0016113151 |
| 34 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00076824554 |
| 78 |
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces |
1998 |
VLDB |
0.00056385781 |
| 91 |
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces |
1997 |
VLDB |
0.00051785122 |
| 210 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00034086264 |
| 579 |
Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting |
2012 |
SIGMOD |
0.0001982328 |
| 596 |
Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search |
2016 |
VLDB |
0.00019455943 |
| 675 |
Quality and Efficiency in High Dimensional Nearest Neighbor Search |
2009 |
SIGMOD |
0.00018304179 |
| 763 |
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search |
2021 |
VLDB |
0.00016963981 |
| 858 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015833075 |
| 1,157 |
A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series |
2013 |
VLDB |
0.00013600695 |
| 1,225 |
SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search |
2014 |
VLDB |
0.00013182109 |
| 1,934 |
VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning |
2020 |
VLDB |
0.00010047294 |
| 1,966 |
LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index |
2016 |
SIGMOD |
9.9130791e-05 |
| 2,002 |
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases |
2023 |
SIGMOD |
9.8258191e-05 |
| 2,099 |
What is the nearest neighbor in high dimensional spaces? |
2000 |
VLDB |
9.5429949e-05 |
| 2,160 |
PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search |
2020 |
VLDB |
9.4037759e-05 |
| 2,366 |
Data Market Platforms: Trading Data Assets to Solve Data Problems |
2020 |
VLDB |
8.9521259e-05 |
| 2,969 |
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces |
2023 |
VLDB |
7.7955562e-05 |
| 3,199 |
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search |
2020 |
VLDB |
7.3999833e-05 |
| 3,403 |
ELPIS: Graph-Based Similarity Search for Scalable Data Science |
2023 |
VLDB |
7.1338786e-05 |
| 3,544 |
Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach |
2018 |
VLDB |
6.98759e-05 |
| 4,230 |
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring |
2020 |
SIGMOD |
6.3337893e-05 |
| 5,156 |
Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes |
2018 |
VLDB |
5.6534878e-05 |
| 5,747 |
Hercules Against Data Series Similarity Search |
2022 |
VLDB |
5.3427166e-05 |
| 7,090 |
Dumpy: A Compact and Adaptive Index for Large Data Series Collections |
2023 |
SIGMOD |
4.8318862e-05 |
| 9,208 |
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search |
2023 |
VLDB |
4.3693005e-05 |
Semantically Similar Papers