Permutation Search Methods are Efficient, Yet Faster Search is Possible
Summary: Permutation-based kNN uses pivot-ranked permutations as distance proxies for metric and non-metric spaces. Evaluated against multi-probe LSH, VP-tree, and proximity-graph baselines on large in-memory image/text data, permutation methods show reasonable accuracy and efficiency; code and data released. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Bilegsaikhan Naidan
- 2. Leonid Boytsov
- 3. Eric Nyberg
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 770 | A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search | 2021 | VLDB | 0.00016917602 |
| 4,731 | Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art | 2025 | SIGMOD | 5.966659e-05 |
| 10,166 | FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 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 |
| 137 | H-Store: A High-Performance, Distributed Main Memory Transaction Processing System | 2008 | VLDB | 0.00042342967 |
| 709 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD | 0.00017768547 |
| 1,229 | SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search | 2014 | VLDB | 0.00013157271 |
Previous
Page 1 / 1
Next