DBScholar

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
13642
Venue
VLDB
Year
2024
Pagerank
6.0850924e-05
Overall Rank
5,800 | 60.21%
DOI
10.14778/3665844.3665854

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wei_vldb24,
        title = {{DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search}},
        author = {Wei, Jiuqi and Peng, Botao and Lee, Xiaodong and Palpanas, Themis},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {9},
        pages = {2241--2254},
        doi = {10.14778/3665844.3665854},
        url = {https://doi.org/10.14778/3665844.3665854},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank Citing Paper Year Venue Pagerank
6,148 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 5.9593368e-05
6,432 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 5.8801533e-05
6,820 DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter 2025 SIGMOD 5.7632132e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
9,360 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2819088e-05
9,377 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.2755515e-05
9,892 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 5.1997534e-05
10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,417 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,493 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

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.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
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
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,084 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012256753
1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011508159
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
1,572 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010329197
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-05
2,025 Data Market Platforms: Trading Data Assets to Solve Data Problems 2020 VLDB 9.2903125e-05
2,158 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0622995e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-05
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.5711218e-05
3,486 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.3696676e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
5,231 Hercules Against Data Series Similarity Search 2022 VLDB 6.3068064e-05
6,691 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.8011086e-05
9,278 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.2936898e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 6,583 Distance-Sensitive Hashing 2018 PODS
2 3,279 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
3 990 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
4 2,010 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB
5 581 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
6 332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
7 369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
8 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
9 1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
10 2,673 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD