Database Paper Browser

Back to papers

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

Summary: SK-LSH proposes SortingKeys-LSH, an efficient index for ANN. It defines a distance on compound hash keys with a linear order to localize nearby points, so only a small set of pages is read, reducing I/O and improving accuracy vs LSB, C2LSH, and CK-Means. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10952
Venue
VLDB
Year
2014
Pagerank
0.00013182109
Overall Rank
1,225 | 91.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 18 of 18 citing papers.

Rank Citing Paper Year Venue Pagerank
210 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034086264
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
1,013 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014632051
1,252 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00013023834
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,434 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 8.8225986e-05
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
4,230 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.3337893e-05
4,598 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.053944e-05
5,349 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 5.5541926e-05
5,577 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 5.423881e-05
6,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
7,549 LIDER: An Efficient High-dimensional Learned Index for Large-scale Dense Passage Retrieval 2023 VLDB 4.7089636e-05
7,848 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 4.6323445e-05
8,495 DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph 2025 SIGMOD 4.4938255e-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,275 Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search 2026 VLDB 4.1905499e-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
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
129 The X-tree: An Index Structure for High-Dimensional Data 1996 VLDB 0.00044255276
301 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028396714
399 Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search 2007 VLDB 0.00024359304
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
3,515 Inter-Media Hashing for Large-scale Retrieval from Heterogeneous Data Sources 2013 SIGMOD 7.0191008e-05
4,663 Towards Effective Indexing for Very Large Video Sequence Database 2005 SIGMOD 6.0066508e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
579 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.0001982328
8,759 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.4520434e-05
4,230 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 6.3337893e-05
1,966 LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index 2016 SIGMOD 9.9130791e-05
6,375 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0868008e-05
858 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015833075
675 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018304179
2,160 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 9.4037759e-05
596 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00019455943
2,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05