Performance Comparison of the {\rm R}^{\ast}-Tree and the Quadtree for kNN and Distance Join Queries
Tóm tắt
Từ khóa
Tài liệu tham khảo
hjaltason, 1999, Incremental Distance Join Algorithms for Spatial Databases, Proc ACM SIGMOD, 265
moon, 2001, Duality-Based Subsequence Matching in Timeseries Databases, Proc Int'l Conf Data Eng (ICDE), 263, 10.1109/ICDE.2001.914837
moon, 2002, General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows, Proc ACM SIGMOD, 382
agrawal, 1993, Efficient Similarity Search in Sequence Databases, Proc Int'l Conf Foundations of Data Organization and Algorithms (FODO), 69, 10.1007/3-540-57301-1_5
samet, 2006, Foundations of Multidimensional and Metric Data Structures
shekhar, 2003, Spatial Databases A Tour
samet, 1990, Applications of Spatial Data Structures
b�hm, 2000, High Performance Clustering Based on the Similarity Join, Proc Conf Information and Knowledge Management (CIKM), 298
corral, 2001, Processing Distance-Based Queries in Multidimensional Data Spaces Using R-Trees, Proc Panhellenic Conf Informatics, 1
b�hm, 2002, High Performance Data Mining Using the Nearest Neighbor Join, Proc IEEE Int'l Conf Data Mining (ICDM), 43
hoel, 1995, Benchmarking Spatial Join Operations with Spatial Output, Proc Int'l Conf Very Large Data Bases, 606