A New Approach for Optimization of Dynamic Metric Access Methods Using an Algorithm of Effective Deletion
暂无分享,去创建一个
Agma J. M. Traina | Caetano Traina | Daniel dos Santos Kaster | Renato Bueno | C. Traina | A. Traina | D. S. Kaster | Renato Bueno
[1] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[2] Christos Faloutsos,et al. Fast Indexing and Visualization of Metric Data Sets using Slim-Trees , 2002, IEEE Trans. Knowl. Data Eng..
[3] Sergey Brin,et al. Near Neighbor Search in Large Metric Spaces , 1995, VLDB.
[4] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[5] Peter M. G. Apers,et al. Multimedia Databases in Perspective , 1997, Springer London.
[6] Christos Faloutsos,et al. Indexing of Multimedia Data , 1997, Multimedia Databases in Perspective.
[7] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[8] Marcos R. Vieira,et al. DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data , 2010, J. Inf. Data Manag..
[9] Václav Snásel,et al. Revisiting M-Tree Building Principles , 2003, ADBIS.
[10] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[11] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[12] Z. Meral Özsoyoglu,et al. Indexing large metric spaces for similarity search queries , 1999, TODS.
[13] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.