Distance-based indexing for high-dimensional metric spaces
暂无分享,去创建一个
[1] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.
[2] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[3] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.
[4] Hanan Samet,et al. The Design and Analysis of Spatial Data Structures , 1989 .
[5] Hanan Samet,et al. Hierarchical Spatial Data Structures , 1989, SSD.
[6] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[7] Dennis Shasha,et al. New techniques for best-match retrieval , 1990, TOIS.
[8] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[9] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[10] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[11] Clu-istos Foutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[12] Tzi-cker Chiueh,et al. Content-Based Image Indexing , 1994, VLDB.
[13] K. Wakimoto,et al. Efficient and Effective Querying by Image Content , 1994 .
[14] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[15] Sergey Brin,et al. Near Neighbor Search in Large Metric Spaces , 1995, VLDB.