Abstract
Several applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, which are capable of indexing spatiotemporal data. Our experiments focus on discretely moving points (i.e., points standing at a specific location for a time period and then moving “instantaneously”, and so on and so forth). We explore several parameters, e.g., initial spatial distribution, spatial query area and temporal query length. We found out that the HR-tree usually outperforms the other candidates, in terms of query processing cost, specially when querying time points and small time intervals. However, the main side effect of the HR-tree is its storage requirement, which is much larger than that of the other approaches. To reduce that, we explore a batch oriented updating approach, at the cost of some overhead during query processing time. To our knowledge, this study constitutes the first extensive, though not exhaustive, experimental comparison of access structures for spatiotemporal data.
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
N. Beckmann et al. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of the 1990 ACM SIGMOD Intl. Conf. on Management of Data, pages 322–331, June 1990. 172, 177
R. Bliujute et al. R-tree based indexing of now-relative bitemporal data. In Proc. of the 24th Very Large Databases Conf., pages 345–356, August 1998. 174
J. Clifford et al. On the semantics of “NOW” in temporal databases. ACM Transactions on Database Systems, 22(2):171–214, 1997. 174
Informix Corp. Developing datablade modules for informix dynamic server with universal data option. White paper, 1998. 172
Egenhofer, M. J. and Golledge, R. G. (Eds.). Spatial and Temporal Reasoning in Geographical Information Systems. Oxford Univ. Press, New York, USA, 1998. 171
V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):123–169, 1998. 172
A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. of the 1984 ACM SIGMOD Intl. Conf. on Management of Data, pages 47–57, June 1984. 172
I. Kamel and C. Faloutsos. Hilbert R-tree: An improved R-tree using fractals. In Proc. of the 20th Very Large Databases Conf., pages 500–509, September 1994. 172, 177
G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In Proc. of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 261–272, May 1999. 172
A. Kumar, V. J. Tsotras, and C. Faloutsos. Access methods for bi-temporal databases. In Proc. of the International Workshop on Temporal Databases, pages 235–254, September 1995. 175
Y. Manolopoulos and G. Kapetanakis. Overlapping B+-trees for temporal data. In Proc. of the 5th Jerusalem Conf. on Information Technology, pages 491–498, August 1990. 174
M. A. Nascimento, J. R. O. Silva, and Y. Theodoridis. Access structures for moving points. Technical Report 33, TimeCenter, 1998. 177, 178, 186
M. A. Nascimento and J. R. O. Silva. Towards historical R-trees. In Proc. of the 1998 ACM Symposium on Applied Computing, pages 235–240, February 1998. 172, 173, 176
D. Pfoser and C. S. Jensen. Capturing the uncertainty of moving-objects representation. In Proc. of the 6th Intl. Symposium on Spatial Databases, July 1999. To appear. 172
B. Salzberg and V. J. Tsotras. A comparison of access methods for time evolving data. Technical Report 18, TimeCenter, 1997. To appear at ACM Computing Surveys. 172
H. Samet. The Design and Analysis of Spatial Data Strucutures. Addison-Wesley, Reading, USA, 1990. 172, 174
T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-tree: A dynamic index for multidimensional objects. In Proc. of the 13th Very Large Databases Conf., pages 507–518, September 1987. 172, 177
J. Tayeb, O. Ulusoy, and O. Wolfson. A quadtree based dynamic attribute indexing method. Computer Journal, 41(3):185–200, 1998. 174
Y. Theodoridis et al. Specifications for efficient indexing in spatiotemporal databases. In Proc. of the 10th IEEE Intl. Conf. on Scientific and Statistical Database Management, pages 123–132, July 1998. 171, 172, 173
Y. Theodoridis, J. R. O. Silva, and M. A. Nascimento. On the generation of spatiotemporal datasets. In Proc. of the 6th Intl. Symposium on Spatial Databases, July 1999. To appear. 172, 177
Y. Theodoridis, E. Stefanakis, and T. Sellis. Efficient cost models for spatial queries using R-trees. Technical Report CH-98-5, Chorochronos, 1998. To appear at IEEE Transactions on Knowledge and Data Engineering. 187
Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-temporal indexing for large multimedia applications. In Proc. of the 3rd IEEE Conf. on Multimedia Computing and Systems, pages 441-448, June 1996. 172, 173, 174
T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping linear quadtrees: a spatio-temporal access method. In Proc. of the 6th ACM Intl. Workshop on Geographical Information Systems, pages 1–7, November 1998. 172, 173
O. Wolfson et al. Moving objects databases: Issues and solutions. In Proc. of the 10th IEEE Intl. Conf. on Scientific and Statistical Database Management, pages 111–122, July 1998. 172
X. Xu, J. Han, and W. Lu. RT-tree: An improved R-tree index structure for spatiotemporal databases. In Proc. of the 4th Intl. Symposium on Spatial Data Handling, pages 1040–1049, 1990. 172, 173
C. Zaniolo et al., editors. Advanced Databases Systems. Morgan Kauffman, San Francisco, USA, 1997. 171
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nascimento, M.A., Silva, J.R.O., Theodoridis, Y. (1999). Evaluation of Access Structures for Discretely Moving Points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds) Spatio-Temporal Database Management. STDBM 1999. Lecture Notes in Computer Science, vol 1678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48344-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-48344-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66401-7
Online ISBN: 978-3-540-48344-1
eBook Packages: Springer Book Archive