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. © Springer-Verlag 2004.
CITATION STYLE
Zimbrão, G., De Souza, J. M., & De Almeida, V. T. (2004). Efficient processing of spatiotemporal joins. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2973, 190–195. https://doi.org/10.1007/978-3-540-24571-1_16
Mendeley helps you to discover research relevant for your work.