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
h953090631656a65d
Venue
VLDB
Year
2024
Pagerank
6.0936219e-05
Overall Rank
5,527 | 62.85%
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 13 of 13 citing papers.

Rank Citing Paper Year Venue Pagerank
4,598 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.5086378e-05
6,126 DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter 2025 SIGMOD 5.8785006e-05
6,560 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 5.7482184e-05
7,264 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5703557e-05
9,136 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2224279e-05
9,563 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.1571823e-05
10,078 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 5.0830849e-05
10,323 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.0346745e-05
10,325 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0346745e-05
10,326 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.0346745e-05
10,680 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD 4.9793485e-05
10,827 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB 4.9793485e-05
10,900 ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search 2026 VLDB 4.9793485e-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.001992968
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011405675
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.00040370171
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020445545
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016121388
927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013025904
1,095 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012050625
1,170 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.0001171991
1,328 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011003106
1,485 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010523759
1,530 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.00010344205
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
1,845 Data Market Platforms: Trading Data Assets to Solve Data Problems 2020 VLDB 9.5136397e-05
2,113 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0196806e-05
2,265 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7238222e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0861221e-05
2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8000797e-05
3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.2438813e-05
4,680 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4722037e-05
5,313 Hercules Against Data Series Similarity Search 2022 VLDB 6.1846986e-05
6,609 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7354155e-05
9,440 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.1771634e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 6,704 Distance-Sensitive Hashing 2018 PODS
2 2,969 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
3 927 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
4 1,897 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB
5 576 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
6 298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
7 338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
8 1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
9 1,485 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
10 2,505 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD