DBScholar

Back to papers

SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search

Summary: SK-LSH imposes a linear order on compound LSH keys using a novel distance measure, co-locating nearby candidates in index pages. It cuts random I/O and verification cost while improving ANN accuracy versus LSB, C2LSH, and CK-Means. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
hae9afac026631fa0
Venue
VLDB
Year
2014
Pagerank
0.00013026835
Overall Rank
925 | 93.81%
DOI
10.14778/2732939.2732947
PDF
Download (CC BY-NC-ND 3.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{liu_vldb14,
        title = {{SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search}},
        author = {Liu, Yingfan and Cui, Jiangtao and Huang, Zi and Li, Hui and Shen, Heng Tao},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {9},
        pages = {745--756},
        doi = {10.14778/2732939.2732947},
        url = {https://doi.org/10.14778/2732939.2732947},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
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
650 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015142453
710 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00014598403
1,318 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00011035606
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,881 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 9.4262036e-05
2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.7879589e-05
3,552 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 7.1888282e-05
4,077 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.8040917e-05
4,868 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.3593681e-05
5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0804398e-05
7,286 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5493084e-05
7,341 LIDER: An Efficient High-dimensional Learned Index for Large-scale Dense Passage Retrieval 2023 VLDB 5.5333312e-05
7,616 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 5.4672835e-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,816 Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search 2026 VLDB 4.9605343e-05
10,938 CONDA: A Connectivity-Aware Dynamic Index for Approximate Nearest Neighbor Search over Evolving Data 2026 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
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
90 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00034749222
281 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00022262975
282 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00022250557
339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020558018
578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00016079505
4,171 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 6.7511262e-05
4,734 Towards Effective Indexing for Very Large Video Sequence Database 2005 SIGMOD 6.4311188e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 339 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD
2 5,814 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS
3 2,968 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD
4 1,524 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD
5 5,526 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB
6 562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB
7 578 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD
8 1,460 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB
9 286 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB
10 1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB