Abstract
The TPR*-tree is most popularly accepted as an index structure for processing future-time queries in moving object databases. In the TPR*-tree, the future locations of moving objects are predicted based on the CBR(Conservative Bounding Rectangle). Since the areas predicted from CBRs tend to grow rapidly over time, CBRs thus enlarged lead to serious performance degradation in query processing. Against the problem, we propose a novel method to adjust CBRs to be tight, thereby improving the performance of query processing. Our method examines whether the adjustment of a CBR is necessary when accessing a leaf node for processing a user query. Thus, it does not incur extra disk I/Os in this examination. Also, in order to make a correct decision, we devise a cost model that considers the I/O overhead for the CBR adjustment and the performance gain in the future-time owing to the CBR adjustment. With the cost model, we can prevent unusual expansions of BRs even when updates on nodes are infrequent and also avoid unnecessary execution of the CBR adjustment. For performance evaluation, we conducted a variety of experiments. The results show that our method improves the performance of the original TPR*-tree significantly.
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
Beckmann, N., et al.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM Int’l. Conf. on Management of Data(ACM SIGMOD), pp. 322–331. ACM Press, New York (1990)
Lee, D.L., Xu, J., Zheng, B., Lee, W.C.: Data Management in Location-Dependent Information Services. IEEE Pervasive Computing 1(3), 65–72 (2002)
Lin, B., Su, J.: On Bulk Loading TPR-Tree. In: Proc. IEEE Int’l. Conf. on Mobile Data Management, pp. 395–406 (2004)
Mokbel, M.F., Ghanem, T.M., Aref, W.G.: Spatio-Temporal Access Methods. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering 26(2), 40–49 (2003)
Prabhakar, S., et al.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Trans. on Computers 51(10), 1124–1140 (2002)
Saltenis, S., et al.: Indexing the Positions of Continuously Moving Objects. In: Proc. ACM Int’l. Conf. on Management of Data(ACM SIGMOD), pp. 331–342. ACM Press, New York (2000)
Sistla, A.P., et al.: Modeling and Querying Moving Objects. In: Proc. IEEE Int’l. Conf. on Data Engineering (ICDE), pp. 422–432 (1997)
Tao, Y., Papadias, D., Sun, J.: The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In: Proc. Int’l. Conf. on Very Large Data Bases (VLDB), pp. 790–801 (2003)
Theodoridis, Y., Silva, R., Nascimento, M.: On the Generation of Spatiotemporal Datasets. In: Proc. Int’l. Symp. on Spatial Databases, pp. 147–164 (1999)
Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving Objects Databases: Issues and Solutions. In: Proc. Int’l. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 111–122 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, SW., Jang, MH., Lim, S. (2007). Active Adjustment: An Approach for Improving the Performance of the TPR*-Tree. In: Wagner, R., Revell, N., Pernul, G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74469-6_81
Download citation
DOI: https://doi.org/10.1007/978-3-540-74469-6_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74467-2
Online ISBN: 978-3-540-74469-6
eBook Packages: Computer ScienceComputer Science (R0)