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.0804398e-05
Overall Rank
5,526 | 62.96%
DOI
10.14778/3665844.3665854
PDF
Download (CC BY-NC-ND 4.0)

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,157 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.7596305e-05
5,376 RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference 2026 VLDB 6.139877e-05
6,141 DIGRA: A Dynamic Graph Indexing for Approximate Nearest Neighbor Search with Range Filter 2025 SIGMOD 5.856289e-05
7,286 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5493084e-05
9,168 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2026953e-05
9,596 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.1376962e-05
10,117 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 5.0638787e-05
10,356 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.0156513e-05
10,358 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0156513e-05
10,359 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.0156513e-05
10,752 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD 4.9605343e-05
10,898 Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization 2026 VLDB 4.9605343e-05
10,970 ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search 2026 VLDB 4.9605343e-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.0019892478
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011386412
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057610161
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00044967652
56 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0004024707
75 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037163157
286 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00022090962
335 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.0002067515
339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020558018
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016344855
578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016079505
925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB 0.00013026835
1,098 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012016918
1,165 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011708765
1,318 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011035606
1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010558941
1,524 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 0.0001033427
1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.00010045437
1,858 Data Market Platforms: Trading Data Assets to Solve Data Problems 2020 VLDB 9.4779185e-05
2,129 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 8.9877592e-05
2,268 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7144632e-05
2,733 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0653682e-05
2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.7879589e-05
3,521 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.2177846e-05
4,693 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4490657e-05
5,335 Hercules Against Data Series Similarity Search 2022 VLDB 6.1613957e-05
6,621 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.7145251e-05
9,478 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.1576017e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 6,717 Distance-Sensitive Hashing 2018 PODS
2 2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
3 925 SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search 2014 VLDB
4 1,881 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB
5 578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
6 286 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
7 339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
8 1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
9 1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
10 2,501 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD