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)
Incoming Non-self Citations Over Time
Authors
- 1. Aristides Gionis (Stanford University)
- 2. Piotr Indyk (Stanford University)
- 3. Rajeev Motwani (Stanford University)
BibTeX Citation
@article{gionis_vldb99,
title = {{Similarity Search in High Dimensions via Hashing}},
author = {Gionis, Aristides and Indyk, Piotr and Motwani, Rajeev},
journal = {PVLDB},
series = {{VLDB} '99},
pages = {518--529},
year = {1999}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 129 citing papers.
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 |
|---|---|---|---|---|
| 46 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00044853085 |
| 168 | Wavelet-Based Histograms for Selectivity Estimation | 1998 | SIGMOD | 0.00027541029 |
| 261 | Approximate Medians and other Quantiles in One Pass and with Limited Memory | 1998 | SIGMOD | 0.00023097188 |
| 277 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00022537944 |
| 353 | The Query By Image Content (QBIC) System | 1995 | SIGMOD | 0.00020370587 |
| 508 | Random Sampling for Histogram Construction: How much is enough? | 1998 | SIGMOD | 0.00017275873 |
| 797 | Dimensionality Reduction for Similarity Searching in Dynamic Databases | 1998 | SIGMOD | 0.00013927251 |
| 2,101 | A Cost Model for Similarity Queries in Metric Spaces | 1998 | PODS | 9.1657486e-05 |
| 2,421 | Multidimensional Access Methods: Trees Have Grown Everywhere | 1997 | VLDB | 8.6033032e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,158 | What is the nearest neighbor in high dimensional spaces? | 2000 | VLDB |
| 2 | 690 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD |
| 3 | 4,927 | Neighbor-Sensitive Hashing | 2016 | VLDB |
| 4 | 5,666 | Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search | 2015 | PODS |
| 5 | 580 | SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index | 2015 | VLDB |
| 6 | 2,673 | DSH: Data Sensitive Hashing for High-Dimensional k-NN Search | 2014 | SIGMOD |
| 7 | 705 | HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces | 2018 | VLDB |
| 8 | 581 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD |
| 9 | 46 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB |
| 10 | 8,655 | A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases | 2006 | SIGMOD |