The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries

@inproceedings{Katayama1997TheSA,
  title={The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries},
  author={Norio Katayama and Shin'ichi Satoh},
  booktitle={SIGMOD Conference},
  year={1997}
}
Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this technique to large databases, it is required to develop multidimensional index structures supporting nearest neighbor queries efficiently. The SS-tree had been proposed for this purpose and is known to outperform other index structures such as the R*-tree and the K-D-B-tree. One of its most important features is that it employs bounding spheres rather than bounding… CONTINUE READING
Highly Influential
This paper has highly influenced 83 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,156 citations. REVIEW CITATIONS
623 Citations
1 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 623 extracted citations

1,156 Citations

050'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 1,156 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…