Efficient Processing Of Spatiotemporal Joins
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS(2004)
摘要
Among other operations, a spatiotemporal DBMS should efficiently answer the spatiotemporal join. This paper presents an evaluation of spatiotemporal join algorithms using these new structures, particularly a partially persistent R-Tree called Temporal R-Tree and the 2+3D R-Tree. Starting from spatial join algorithms, we present algorithms for processing spatiotemporal joins over time instants and intervals on both spatiotemporal data structures. Finally, we implement and test these new algorithms with a couple of generated spatiotemporal data sets. Our experiments show that our algorithms' performance is good even in extreme cases, showing its good scalability-especially for the TR-Tree.
更多查看译文
关键词
spatiotemporal access methods,spatiotemporal join
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络