NDLI: An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Regev, Oded Chakrabarti, Amit
Copyright Year	2010
Abstract	We consider the approximate nearest neighbor search problem on the Hamming cube $\{0,1\}^d$. We show that a randomized cell probe algorithm that uses polynomial storage and word size $d^{O(1)}$ requires a worst case query time of $\Omega({\rm log}\,{\rm log}\,d/{\rm log}\,{\rm log}\,{\rm log}\,d)$. The approximation factor may be as loose as $2^{{\rm log}^{1-\eta}d}$ for any fixed $\eta>0$. Our result fills a major gap in the study of this problem since all earlier lower bounds either did not allow randomization [A. Chakrabarti et al., A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube, in Discrete and Computational Geometry, Springer, Berlin, 2003, pp. 313328; D. Liu, Inform. Process. Lett., 92 (2004), pp. 2329] or did not allow approximation [A. Borodin, R. Ostrovsky, and Y. Rabani, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 312321; O. Barkol and Y. Rabani, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 388396; T. S. Jayram et al., J. Comput. System Sci., 69 (2004), pp. 435447]. We also give a cell probe algorithm that proves that our lower bound is optimal. Our proof uses a lower bound on the round complexity of the related communication problem. We show, additionally, that considerations of bit complexity alone cannot prove any nontrivial cell probe lower bound for the problem. This shows that the richness technique [P. B. Miltersen et al., J. Comput. System Sci., 57 (1998), pp. 3749] used in a lot of recent research around this problem would not have helped here. Our proof is based on information theoretic techniques for communication complexity, a theme that has been prominent in recent research [A. Chakrabarti et al., Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 270278; Z. Bar-Yossef et al., Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 209218; P. Sen, Proceedings of the 18th Annual IEEE Conference on Computational Complexity, 2003, pp. 7383; R. Jain, J. Radhakrishnan, and P. Sen, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, 2003, pp. 300315].
Starting Page	1919
Ending Page	1940
Page Count	22
File Format	PDF
ISSN	00975397
DOI	10.1137/080729955
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	5
Volume Number	39
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2010-02-03
Access Restriction	Subscribed
Subject Keyword	round elimination Computational difficulty of problems nearest neighbor search cell probe model Data structures
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching (2003)

Randomized Approximate Nearest Neighbor Search with Limited Adaptivity

An optimal randomised cell probe lower bound for approximate nearest neighbour searching

Bit-Probe Lower Bounds for Succinct Data Structures

A Space Lower Bound for Dynamic Approximate Membership Data Structures

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model (2000)

A cell probe lower bound for dynamic nearest-neighbor searching

Expected-Case Complexity of Approximate Nearest Neighbor Searching

An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

Similar Documents

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching (2003)

Randomized Approximate Nearest Neighbor Search with Limited Adaptivity

An optimal randomised cell probe lower bound for approximate nearest neighbour searching

Bit-Probe Lower Bounds for Succinct Data Structures

A Space Lower Bound for Dynamic Approximate Membership Data Structures

Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model (2000)

A cell probe lower bound for dynamic nearest-neighbor searching

Expected-Case Complexity of Approximate Nearest Neighbor Searching

An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching