NDLI: Lower Bounds on Near Neighbor Search via Metric Expansion

Content Provider	IEEE Xplore Digital Library
Author	Panigrahy, R. Talwar, K. Wieder, U.
Copyright Year	2010
Abstract	In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we look at the graph obtained by connecting every pair of points within a certain distance $r$ . We then look at various notions of expansion in this graph relating them to the cell probe complexity of NNS for randomized and deterministic, exact and approximate algorithms. For example if the graph has node expansion $\Phi$ then we show that any deterministic $t$-probe data structure for $n$ points must use space $S$ where $(St/n)^t > \Phi$. We show similar results for randomized algorithms as well. These relationships can be used to derive most of the known lower bounds in the well known metric spaces such as $l_1$, $l_2$, $l_\infty$, and some new ones, by simply computing their expansion. In the process, we strengthen and generalize our previous results~\cite{PTW08}. Additionally, we unify the approach in~\cite{PTW08} and the communication complexity based approach. Our work reduces the problem of proving cell probe lower bounds of near neighbor search to computing the appropriate expansion parameter. In our results, as in all previous results, the dependence on $t$ is weak, that is, the bound drops exponentially in $t$. We show a much stronger (tight) time-space tradeoff for the class of \emph{dynamic} \emph{low contention} data structures. These are data structures that supports updates in the data set and that do not look up any single cell too often. A full version of the paper could be found in [19].
Starting Page	805
Ending Page	814
File Size	561927
Page Count	10
File Format	PDF
ISBN	9781424485253
ISSN	02725428
DOI	10.1109/FOCS.2010.82
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-10-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data structures Measurement Artificial neural networks Complexity theory Probes Robustness Approximation methods Expansion Data Structures Metric Spaces
Content Type	Text
Resource Type	Article

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

Lower bounds on near neighbor search via metric expansion (2010)

Lower Bounds on Near Neighbor Search via Metric Expansion

Lower bounds on near neighbor search via metric expansion

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

Approximating Minimization Diagrams and Generalized Proximity Search

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

Artificial neural networks for the nearest neighbor search problem

Higher Cell Probe Lower Bounds for Evaluating Polynomials

Lower Bounds on Near Neighbor Search via Metric Expansion

Similar Documents

Lower bounds on near neighbor search via metric expansion (2010)

Lower Bounds on Near Neighbor Search via Metric Expansion

Lower bounds on near neighbor search via metric expansion

A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

Approximating Minimization Diagrams and Generalized Proximity Search

Higher Lower Bounds for Near-Neighbor and Further Rich Problems

Artificial neural networks for the nearest neighbor search problem

Higher Cell Probe Lower Bounds for Evaluating Polynomials

Lower Bounds on Near Neighbor Search via Metric Expansion