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

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 369-380

  Katayama, Norio ^a   Satoh, Shin'ichi ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; MATHEMATICAL TECHNIQUES; TREES (MATHEMATICS);

NEAREST NEIGHBOR QUERIES; SPHERE/RECTANGLE TREE;

QUERY LANGUAGES;

EID: 0031162081     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253347     Document Type: Article

References (16)

1. M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic, D. Steele, and P. Yanker, "Query by Image and Video Content: the QBIC System." IEEE Computer. Vol.28, No.9, pp.23-32, Sep. 1995.
2. H. D. Wactlar, T. Kanade, M. A. Smith, and S. M. Stevens, "Intelligent Access to Digital Video: Informedia Project," IEEE Computer, Vol.29, No.5, pp.46-52, May 1996.
3. D. A. White and R. Jain, "Similarity Indexing with the SS-tree." Proc. of the 12th Int. Conf. on Data Engineering, New Orleans, USA, pp.516-523. Feb. 1996.
4. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-tree: an Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, Atlantic City, USA, pp.322-331, May 1900.
5. J. T. Robinson, "The K-D-B-tree: a Search Structure for Large Multidimensional Dynamic Indexes," Proc. ACM SIGMOD, Ann Arbor, USA, pp.10-18, Apr. 1981.
6. H. Y. Jagadish, "Spatial Search with Polyhedra," Proc. of the 6th Int. Conf. on Data Engineering. Los Angeles, USA, pp.311-319, Feb. 1990.
7. T. Brinkhoff, H.-P. Kriegel, R. Schneider, B. Seeger, "Multi-Step Processing of Spatial Joins," Proc. ACM SIGMOD, Minneapolis, USA. pp.197-208, May 1994.
8. A. Guttman, "R-trees: a Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, Boston, USA, pp.47-57, Jun. 1981.
9. D. A. White and R. Jain, "Similarity Indexing: Algorithms and Performance," Proc. SPIE Vol.2670, San Diego, USA, pp.62-73, Jan. 1996.
10. J. L. Bentley, "Multidimensional Binary Search Trees Used for Associative Searching," Comm. of the ACM, Vol.18, No.9, pp.509-517, Sep. 1975.
11. R. Sproull, "Refinements to Nearest-Neighbor Searching in k-Dimensional Trees," Algorithmica, Vol.6, No.4, pp.579-589, 1991.
12. K.-I. Lin, H. V. Jagadish, and C. Faloutsos, "The TV-tree: An Index Structure for High-Dimensional Data," VLDB Journal, Vol. 3, No. 4, pp.517-542, 1994.
13. S. Berchtold, D. A. Keim, and H.-P. Kriegel, "The X-tree: An Index Structure for High-Dimensional Data," Proc. of the 22nd VLDB Conf., Bombay, India, pp.28-39, Sep. 1996.
14. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD, San Jose, USA, pp.71-79, May 1995.
15. +-tree: a Dynamic Index for Multi-Dimensional Objects," Proc. of the 13th VLDB Conf., Brighton, England, pp.507-518, Sep. 1987.
16. D. Greene, "An Implementation and Performance Analysis of Spatial Data Access Methods," Proc. of the 5th Int. Conf. on Data Engineering, Los Angeles, USA, pp.606-615, Feb. 1989.