Abstract
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.
This work is partially supported by Fundação Universitária José Bonifácio
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An Asymptotically Optimal Multiversion B-tree. The VLDB Journal 5(4), 264–275 (1996)
Brinkhoff, T., Kriegel, H.P., Seeger, B.: Efficient processing of Spatial Joins Using R-Trees. In: Proceedings of the 1993 ACM-SIGMOD Conference, Washington, DC, USA (May 1993)
Kollios, G., Gunopulos, D., Tsotras, V.J., Delis, A., Hadjieleftheriou, M.: Indexing Animated Objects Using Spatiotemporal Access Methods. To appear at IEEE Transactions on Knowledge and Data Engineering
Nascimento, M.A., Silva, J.R.O.: Towards Historical R-trees. In: Proceedings of ACM Symposium on Applied Computing, ACM-SAC (1998)
Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Proceedings of Very Large Data Bases Conference (VLDB), Rome, September 11-14 (2001)
Theodoridis, Y., Silva, J.R.O., Nascimento, M.A.: On the Generation of Spatiotemporal Datasets. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 147. Springer, Heidelberg (1999)
Theodoridis, Y., Sellis, T., Papadopoulos, A.N., Manolopoulos, Y.: Specifications for Efficient Indexing in Spatiotemporal Databases. In: Proceedings of SSDBM 1998, Capri, Italy, July 1-3 (1998)
Zimbrão, G., Almeida, V.T., Souza, J.M.: Efficient Processing of Spatiotemporal Queries in Temporal Geographical Information Systems. In: 6th International Conference on Information Systems, Analysis and Synthesis, ISAS (2000)
Zimbrão, G., Almeida, V.T., Souza, J.M.: The Temporal R-Tree. Technical Report ES492/99, COPPE/Federal University of Rio de Janeiro, Brazil (March 1999)
Zimbrão, G., Almeida, V.T., Souza, J.M.: Processing of Spatiotemporal Joins Using Indexes. Technical Report ES620/03, COPPE/Federal University of Rio de Janeiro, Brazil (December 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zimbrão, G., de Souza, J.M., de Almeida, V.T. (2004). Efficient Processing of Spatiotemporal Joins. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive