Abstract
The advances of wireless communication technologies, personal locator technology, and global positioning systems enable a wide range of location-aware services. To enable the services, a number of spatiotemporal access methods have been proposed for handling timestamp and time interval queries. However, the performance of the existing methods of a single index structure quickly degrades as time progresses. To overcome the problem, we propose to employ time-based partitioning on the R-tree called time boundary-based partitioning with flattened R-tree (BPR-Tree). The proposed scheme employs a new insertion policy to reduce the height of the tree and a time grouping method in order to minimize the search time of various queries. Extensive computer simulation reveals that the proposed scheme significantly outperforms the existing schemes.
This research was supported in part by the Ubiquitous Autonomic Computing and Network Project, 21st Century Frontier R&D Program in Korea and the Brain Korea 21 Project in 2005.
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
Nascimento, M.A., Silva, J.R.O.: Towards historical R-Tree. In: Proceesings of the 13th ACM Symposium on Applied Computing (ACM-SAC 1998), pp. 235–240 (1998)
Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation for access Structures for discretely moving points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 171–188. Springer, Heidelberg (1999)
Tao, Y., Papadias, D.: Mv3R-tree: a spatiotemporal access method for timestamp and intervalqueries. In: Proceedings of the 27th International Conference on Very Large Databases, pp. 431–440 (2001)
Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-temporal Indexing for Large Multimedia Applications. In: Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems, Hiroshima, Japan, pp. 441–448 (1996)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt, pp. 395–406 (2000)
Frentzos, E.: Indexing object moving on fixed networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 289–305. Springer, Heidelberg (2003)
Brinkhoff, T.: Generation Network-Based Moving Objects. In: Proceedings of the 12th Int’l. Conference on Scientific and Statistical Database Management, SSDBM 2000, Berlin, Germany, pp. 253–255 (2000)
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, pp. 147–164. Springer, Heidelberg (1999)
Guttman, A.: R-Tree: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, pp. 47–57 (1984)
Pfoser, D., Jensen, C.S.: Querying the Trajectories of On-Line Mobile Object. TIMECENTER Technical Report, TR-57 (2001)
Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Efficient Indexing of Spatiotemporal Objects. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 251–268. Springer, Heidelberg (2002)
Jung, Y.C., Youn, H.Y., Kim, U.: Efficient Indexing of Moving Objects Using Timebased Partitioning with R-Tree. In: International Conference on Computational Science (ICCS), Atlanta, GA, USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, Y.C., Youn, H.Y., Lee, E.S. (2005). Boundary-Based Time Partitioning with Flattened R-Tree for Indexing Ubiquitous Objects. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_78
Download citation
DOI: https://doi.org/10.1007/11599463_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30856-0
Online ISBN: 978-3-540-32276-4
eBook Packages: Computer ScienceComputer Science (R0)