Browse > Article

The Dynamic Split Policy of the KDB-Tree in Moving Objects Databases  

Lim Duk-Sung (영진전문대학 컴퓨터정보계열)
Lee Chang-Heun (부산정보과학고등학교)
Hong Bong-Hee (부산대학교 공과대학 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.33, no.4, 2006 , pp. 396-408 More about this Journal
Abstract
Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.
Keywords
KDB-tree; Moving Objects Databases; Moving Objects Index; Dynamic Split;
Citations & Related Records
연도 인용수 순위
  • Reference
1 G.Kollios, D. Gunopulos, and V. J. Tsotras, 'On Indexing Mobile Objects,' Int. conf. PODS, pp. 261-272, 1999   DOI
2 S. Saltenis, C.S.Jensen, S.T.Leutenegger, and M.A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' Int. Conf. ACM SIGMOD, pp. 331-342, 2000   DOI
3 Y.Theodoridis, J,R.O. Silva, and M.A. Nascimento, 'On the Generation of Spatio-Temporal Datasets,' Int. conf. SSD, LNCS 1651, Springer, pp. 147-164, 1999
4 D.Pfoser, C. S.Jensen, Y. Theodoridis, 'Novel Approaches in Query Processing for Moving Object Trajectories,' Int. conf. VLDB, pp. 395-406, 2000
5 Y.Tao, D.Papadias, 'MV3R-tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries,' Int. conf. VLDB, pp. 431-440, 2001
6 B. Seeger and H.P. Kriegel, 'The Buddy tree: An Efficient and Robust Access Method for Spatial Data Base Systems,' Int. conf. VLDB, pp. 590-601, 1990
7 A. Henrich, H.-S. Six and P. Widmayer, 'The LSD Tree: Spatial Access to Multidimensional Point and Non-Point Objects,' Int. conf. VLDB, pp. 45-53, 1989
8 M. Freeston, 'A General Solution of the N-dimensional B tree Problem,' Int. Conf. ACM SIGMOD, pp. 80-91, 1995   DOI
9 J,T. Robinson, 'The K-D-B Tree: A Search Structure For Large Multidimensional Dynamic Indexes,' Int. Conf. ACM SIGMOD, pp. 10-18, 1981   DOI
10 Ratko Orlandic, Byunggu Yu, 'Implementing KDB trees to Support High-Dimensional Data,' Int. conf. IDEAS, pp. 58-67, 2001   DOI
11 E.Stefanakis, Y.Theodoridis, Timos Sellis, 'Point Representation of Spatial Objects and Query Window Extension: A New Technique for Spatial Access Methods,' International Journal of Geographical Information Science vol.11, no.6, pp. 529-554, 1997   DOI
12 Volker Gaede, Oliver Gunther, 'Multidimensional Access Methods,' ACM Computer Survey, vol. 30, no. 2, pp. 170-231, 1998   DOI   ScienceOn