Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 245

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

Kushilevitz, Eyal, Ostrovsky, Rafail, Rabani, Yuval·2000·SIAM Journal on Computing

Abstract

We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L 1 norm and in the Hamming cube. Significantly improving and extending recent results of Kleinberg, we construct data structures whose size is polynomial in the size of the database and search algorithms that run in time nearly linear or nearly quadratic in the dimension. (Depending on the case, the extra factors are polylogarithmic in the size of the database.)

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539798347177

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 245

Metadata

Authors
Kushilevitz, E., Ostrovsky, R., & Rabani, Y.
Venue
SIAM Journal on Computing
Published
2000-01
Volume
30
Issue
2
Pages
457-474
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2088101210
Cited by
245
References
2
FWCI
10.05
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. https://app.cochat.ai/papers/10.1137/s0097539798347177
The paper
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000). Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM Journal on Computing. https://doi.org/10.1137/s0097539798347177

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.