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

Norio Katayama, Shin ichi Satoh. The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In Joan Peckham, editor, SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA. pages 369-380, ACM Press, 1997. [doi]

@inproceedings{KatayamaS97,
  title = {The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries},
  author = {Norio Katayama and Shin ichi Satoh},
  year = {1997},
  doi = {10.1145/253260.253347},
  url = {http://doi.acm.org/10.1145/253260.253347},
  researchr = {https://researchr.org/publication/KatayamaS97},
  cites = {0},
  citedby = {0},
  pages = {369-380},
  booktitle = {SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, Tucson, Arizona, USA},
  editor = {Joan Peckham},
  publisher = {ACM Press},
}