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

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

Similarity indexing with the SS-tree

White, D.A., Jain, R.·2002·Proceedings of the Twelfth International Conference on Data Engineering
DOI 10.1109/icde.1996.492202
Open this paper in CoChat — free account

Abstract

Efficient indexing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. We define this problem as "similarity indexing" and describe the fundamental types of "similarity queries" that we believe should be supported. We also propose a new dynamic structure for similarity indexing called the similarity search tree or SS-tree. In nearly every test we performed on high dimensional data, we found that this structure performed better than the R*-tree. Our tests also show that the SS-tree is much better suited for approximate queries than the R*-tree.

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.1109/icde.1996.492202

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 635

Metadata

Authors
White, D. A., & Jain, R.
Venue
Proceedings of the Twelfth International Conference on Data Engineering
Publisher
IEEE Comput. Soc. Press
Published
2002-12-23
Pages
516-523
ISSN
1084-4627 (ISSN-L)
DOI
10.1109/icde.1996.492202
OpenAlex
W2155776210
Cited by
635
References
2
FWCI
54.72
Type
conference paper
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: Similarity indexing with the SS-tree. https://app.cochat.ai/papers/10.1109/icde.1996.492202
The paper
White, D. A., & Jain, R. (2002). Similarity indexing with the SS-tree. Proceedings of the Twelfth International Conference on Data Engineering. https://doi.org/10.1109/icde.1996.492202

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.