The Community for Technology Leaders
RSS Icon
Issue No.11 - November (2009 vol.21)
pp: 1573-1589
MoonBae Song , Sungkyunkwan University, Suwon-Si
Hiroyuki Kitagawa , University of Tsukuba, Tsukuba
Managing frequent updates is greatly important in many update-intensive applications, such as location-aware services, sensor networks, and stream databases. In this paper, we present an R-tree-based index structure (called {\rm R}^{\rm{{sb}}}-tree, R-tree with semibulk loading) for efficiently managing frequent updates from massive moving objects. The concept of semibulk loading is exploiting a small in-memory buffer to defer, buffer, and group the incoming updates and bulk-insert these updates simultaneously. With a reasonable memory overhead (typically only 1 percent of the whole data set), the proposed approach far outperforms the previous works in terms of update and query performance as well in a realistic environment. In order to further increase buffer hit ratio for the proposed approach, a new page-replacement policy that exploits the level of buffered node is proposed. Furthermore, we introduce the concept of deferring threshold ratio (dtr) that simply enables deferring CPU- and I/O-intensive operations such as node splits and removals. Extensive experimental evaluation reveals that the proposed approach is far more efficient than previous approaches for managing frequent updates under various settings.
Indexing moving objects, R-trees, location-aware services, update-intensive applications, frequent updates.
MoonBae Song, Hiroyuki Kitagawa, "Managing Frequent Updates in R-Trees for Update-Intensive Applications", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 11, pp. 1573-1589, November 2009, doi:10.1109/TKDE.2008.225
[1] O. Wolfson, “Moving Objects Information Management: The Database Challenge,” Proc. Workshop Next Generation Information Technologies and Systems (NGITS), 2002.
[2] C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, “Fast Subsequence Matching in Time-Series Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 419-429, 1994.
[3] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, 1984.
[4] X. Xiong and W.G. Aref, “R-Trees with Update Memos,” Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[5] M.-L. Lee, W. Hsu, C.S. Jensen, B. Cui, and K.L. Teo, “Supporting Frequent Updates in R-Trees: A Bottom-Up Approach,” Proc. Int'l Conf. Very Large Data Bases (VLDB '03), pp. 608-619, 2003.
[6] D. Kwon, S. Lee, and S. Lee, “Indexing the Current Positions of Moving Objects Using the Lazy Update R-Tree,” Proc. Int'l Conf. Mobile Data Management (MDM '02), pp. 113-120, 2002.
[7] D. Pfoser, C.S. Jensen, and Y. Theodoridis, “Novel Approaches in Query Processing for Moving Object Trajectories,” Proc. Int'l Conf. Very Large Data Bases (VLDB '00), pp. 395-406, 2000.
[8] S. Saltenis, C.S. Jensen, S. Leutenegger, and M. Lopez, “Indexing the Positions of Continuously Moving Objects,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 331-342, 2000.
[9] S. Prabhakar, Y. Xia, D. Kalashnikov, W. Aref, and S. Hambrusch, “Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, Oct. 2002.
[10] Y. Tao, D. Papadias, and J. Sun, “The ${\rm TPR}^\ast$ -Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 790-801, 2003.
[11] B. Cui, D. Lin, and K.-L. Tan, “IMPACT: A Twin Index Framework for Efficient Moving Object Query Processing,” Data and Knowledge Eng., vol. 59, no. 1, pp. 63-85, 2006.
[12] B.C. Ooi, K.-L. Tan, and C. Yu, “Frequent Update and Efficient Retrieval: An Oxymoron on Moving Object Indexes?” Proc. Int'l Conf. Web Information Systems Eng. Workshop, pp. 3-12, 2002.
[13] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The ${\rm R}^\ast$ -Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-331, 1990.
[14] T. Brinkhoff, “A Robust and Self-Tuning Page-Replacement Strategy for Spatial Database Systems,” Proc. Int'l Conf. Extending Database Technology (EDBT '02), pp. 533-552, 2002.
[15] G.M. Sacco, “Index Access with a Finite Buffer,” Proc. Int'l Conf. Very Large Data Bases (VLDB '87), pp. 301-309, 1987.
[16] S. Leutenegger and M. Lopez, “The Effect of Buffering on the Performance of R-Trees,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 33-44, Jan./Feb. 2000.
[17] G. Graefe, “B-Tree Indexes for High Update Rates,” ACM SIGMOD Record, vol. 35, no. 1, pp. 39-44, 2006.
[18] L. Arge, K. Hinrichs, J. Vahrenhold, and J.S. Vitter, “Efficient Bulk Operations on Dynamic R-Trees,” Algorithmica, vol. 33, no. 1, pp.104-128, 2002.
[19] B. Lin and J. Su, “Handling Frequent Updates of Moving Objects,” Proc. Int'l Conf. Information and Knowledge Management (CIKM '05), pp.493-500, 2005.
[20] X. Xiong, M. Mokbel, and W. Aref, “LUGrid: Update-tolerant Grid-based Indexing for Moving Objects,” Proc. Int'l Conf. Mobile Data Management (MDM '06), pp. 13-13, May 2006.
[21] L. Biveinis, S. Saltenis, and C.S. Jensen, “Main-Memory Operation Buffering for Efficient R-Tree Update,” Proc. Int'l Conf. Very Large Data Bases (VLDB '07), pp. 591-602, 2007.
[22] S. Leutenegger, M. Lopez, and J. Edgington, “STR: A Simple and Efficient Algorithm for R-Tree Packing,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 497-506, 1997.
[23] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[24] Y. Theodoridis and T. Sellis, “A Model for the Prediction of R-Tree Performance,” Proc. ACM Int'l Symp. Principles of Database Systems (PODS '96), pp. 161-171, 1996.
[25] Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis, “An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 10, pp. 1169-1184, 2004.
[26] G. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949.
[27] T. Brinkhoff, “Network-Based Generator of Moving Objects,” brinkhoffgenerator/, 2009.
[28] Y. Theodoridis, J.R.O. Silva, and M.A. Nascimento, “On the Generation of Spatiotemporal Data Sets,” Proc. Symp. Large Spatial Databases (SSD '99), pp. 147-164, 1999.
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool