Database Paper Browser

Back to papers

Similarity Search in High Dimensions via Hashing

Summary: Hashing-based scheme for approximate nearest neighbor in high-dimensional data, exploiting higher collision probability for nearby points. Experiments show substantial speedups over hierarchical-tree methods and scalability beyond 50 dimensions, addressing the curse of dimensionality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8595
Venue
VLDB
Year
1999
Pagerank
0.00076637636
Overall Rank
34 | 99.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 24 of 124 citing papers.

Rank Citing Paper Year Venue Pagerank
10,167 FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity Search 2026 SIGMOD 4.1945683e-05
10,237 Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search 2026 VLDB 4.1945683e-05
10,260 JHQ: Johnson-Lindenstrauss Enhanced Hierarchical Quantization for High-Dimensional Approximate Nearest Neighbor Search 2026 VLDB 4.1945683e-05
10,273 An Experimental Evaluation of Hybrid Querying on Vectors 2026 VLDB 4.1945683e-05
10,303 Elastic Index Selection for Label-Hybrid AKNN Search 2026 VLDB 4.1945683e-05
10,683 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 4.1945683e-05
10,703 Fast Graph Vector Search via Hardware Acceleration and Delayed-Synchronization Traversal 2025 VLDB 4.1945683e-05
10,743 NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance 2025 VLDB 4.1945683e-05
10,930 Similarity Joins of Sparse Features 2024 SIGMOD 4.1945683e-05
11,021 SeLeP: Learning Based Semantic Prefetching for Exploratory Database Workloads 2024 VLDB 4.1945683e-05
11,067 Partition, Don’t Sort! Compression Boosters for Cloud Data Ingestion Pipelines 2024 VLDB 4.1945683e-05
11,168 Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation 2023 PODS 4.1945683e-05
11,170 Unsupervised Hashing with Semantic Concept Mining 2023 SIGMOD 4.1945683e-05
11,378 Interactive Mining with Ordered and Unordered Attributes 2022 VLDB 4.1945683e-05
11,445 Learning Algorithms for Automatic Data Structure Design 2021 SIGMOD 4.1945683e-05
11,541 Fast Algorithm for Anchor Graph Hashing 2021 VLDB 4.1945683e-05
11,554 On the I/O Complexity of the k-Nearest Neighbors Problem 2020 PODS 4.1945683e-05
12,083 Efficiency and Security in Similarity Cloud Services 2013 VLDB 4.1945683e-05
12,091 QuEval: Beyond high-dimensional indexing a la carte 2013 VLDB 4.1945683e-05
12,176 Effective Data Co-Reduction for Multimedia Similarity Search 2011 SIGMOD 4.1945683e-05
12,293 Similarity Caching 2009 PODS 4.1945683e-05
12,357 The Power of Two Min-Hashes for Similarity Search among Hierarchical Data Objects 2008 PODS 4.1945683e-05
12,521 Indexing for Function Approximation 2006 VLDB 4.1945683e-05
12,610 AIMS: An Immersidata Management System 2003 CIDR 4.1945683e-05
Previous Page 3 / 3 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
79 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056242144
222 Wavelet-Based Histograms for Selectivity Estimation 1998 SIGMOD 0.00032828302
275 Approximate Medians and other Quantiles in One Pass and with Limited Memory 1998 SIGMOD 0.00029364901
284 The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries 1997 SIGMOD 0.00028994728
330 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00027229588
530 Random Sampling for Histogram Construction: How much is enough? 1998 SIGMOD 0.00020803682
825 Dimensionality Reduction for Similarity Searching in Dynamic Databases 1998 SIGMOD 0.00016228517
1,811 A Cost Model for Similarity Queries in Metric Spaces 1998 PODS 0.00010467197
1,945 Multidimensional Access Methods: Trees Have Grown Everywhere 1997 VLDB 0.00010001003
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
2,107 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.5330494e-05
5,224 Neighbor-Sensitive Hashing 2016 VLDB 5.6197981e-05
709 Efficient Similarity Search and Classification via Rank Aggregation 2003 SIGMOD 0.00017768547
8,763 Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search 2015 PODS 4.456315e-05
867 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015792021
3,056 DSH: Data Sensitive Hashing for High-Dimensional k-NN Search 2014 SIGMOD 7.6432146e-05
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
682 Quality and Efficiency in High Dimensional Nearest Neighbor Search 2009 SIGMOD 0.00018201541
79 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056242144
8,647 A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases 2006 SIGMOD 4.4768766e-05