Database Paper Browser

Back to papers

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)

Paper ID
11040
Venue
VLDB
Year
2015
Pagerank
5.5529869e-05
Overall Rank
5,352 | 62.77%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers