A strong lower bound for approximate nearest neighbor searching

Authors:
Ding Liu
Affiliations:
Department of Computer Science, Princeton University, Princeton, NJ
Venue:
Information Processing Letters
Year:
2004

Citing 23
Cited 7

A general approach to d-dimensional geometric queries

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
A randomized algorithm for closest-point queries

SIAM Journal on Computing
Ray shooting and parametric search

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

Machine Learning
An algorithm for approximate closest-point queries

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Lower bounds for union-split-find related problems on random access machines

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Two algorithms for nearest-neighbor search in high dimensions

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbor queries revisited

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fuzzy queries in multimedia database systems

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate nearest neighbors: towards removing the curse of dimensionality

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity

Journal of Computer and System Sciences
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximate nearest neighbor queries in fixed dimensions

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Should Tables Be Sorted?

Journal of the ACM (JACM)
Tighter bounds for nearest neighbor search and related problems in the cell probe model

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The discrepancy method: randomness and complexity

The discrepancy method: randomness and complexity
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

SIAM Journal on Computing
Query by Image and Video Content: The QBIC System

Computer
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Limitations of non-uniform computational models

Limitations of non-uniform computational models

Randomization does not help searching predecessors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for predecessor searching in the cell probe model

Journal of Computer and System Sciences
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

SIAM Journal on Computing
Unifying the Landscape of Cell-Probe Lower Bounds

SIAM Journal on Computing
Reordering rows for better compression: Beyond the lexicographic order

ACM Transactions on Database Systems (TODS)
NNS lower bounds via metric expansion for l

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Large-scale image retrieval based on boosting iterative quantization hashing with query-adaptive reranking

Neurocomputing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove a lower bound of d1-o(1) on the query time for any deterministic algorithms that solve approximate nearest neighbor searching in Yao's cell probe model. Our result greatly improves the best previous lower bound for this problem, which is Ω(loglogd/logloglogd) [A. Chakrabarti et al., in: Proc. 31st Ann. ACM Symp. Theory of Computing, 1999, pp. 305-311]. Our proof is also much simpler than the proof of A. Chakrabarti et al.