ATLAS: A Probabilistic Algorithm for High Dimensional Similarity Search
Summary: ATLAS: probabilistic high-dimensional similarity search for binary vectors. Employs truly random permutations to filter candidates and estimate similarity, achieving 97.5% recall and up to 100x speedups over exact/approx methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jiaqi Zhai
- 2. Yin Lou
- 3. Johannes Gehrke
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 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 |
| 250 | Efficient set joins on similarity predicates | 2004 | SIGMOD | 0.00030661988 |
| 266 | Efficient Exact Set-Similarity Joins | 2006 | VLDB | 0.00029718727 |
| 341 | CURE: An Efficient Clustering Algorithm for Large Databases | 1998 | SIGMOD | 0.00026810548 |
| 447 | Efficient Parallel Set-Similarity Joins Using MapReduce | 2010 | SIGMOD | 0.00022900171 |
| 4,090 | Finding Near Neighbors Through Cluster Pruning | 2007 | PODS | 6.4577834e-05 |
| 6,325 | On the Effects of Dimensionality Reduction on High Dimensional Similarity Search | 2001 | PODS | 5.1105081e-05 |
Previous
Page 1 / 1
Next