Browse > Article

A Cost Model for the Performance Prediction of the TPR-tree  

최용진 (한국과학기술원)
정진완 (한국과학기술원 전자전산학과)
Publication Information
Journal of KIISE:Databases / v.31, no.3, 2004 , pp. 252-260 More about this Journal
Abstract
Recently, the TPR-tree has been proposed to support spatio-temporal queries for moving objects. Subsequently, various methods using the TPR-tree have been intensively studied. However, although the TPR-tree is one of the most popular access methods in spatio-temporal databases, any cost model for the TPR-tree has not yet been proposed. Existing cost models for the spatial index such as the R-tree do not accurately ostinato the number of disk accesses for spatio-temporal queries using the TPR-tree, because they do not consider the future locations of moving objects. In this paper, we propose a cost model of the TPR-tree for moving objects for the first time. Extensive experimental results show that our proposed method accurately estimates the number of disk accesses over various spatio-temporal queries.
Keywords
TPR-tree; spatio-temporal databases; moving object; TPR-tree; cost model;
Citations & Related Records
연도 인용수 순위
  • Reference
1 L. Forlizzi, R.H. Guting, E. Nardelli, and M. Schneider, 'A Data Model and Data Structures for Moving Objects Databases,' ACM SIGMOD, 2000   DOI   ScienceOn
2 A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, 'Modeling and Querying Moving Objects,' ICDE, 1997
3 P.K. Agarwal, L. Arge, and J. Erickson, 'Indexing Moving Points,' PODS, 2000   DOI
4 S. Saltenis, C.S. Jensen, 'Indexing of Moving Objects for Location-Based Services,' ICDE, 2002
5 D. Pfoser, C.S. Jensen, and Y. Theodoridis, 'Novel Approaches in Query Processing for Moving Object Trajectories,' VLDB, 2000
6 S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, 'Indexing the Positions of Continuously Moving Objects,' ACM SIGMOD, 2000   DOI   ScienceOn
7 G. Kollios, D. Gunopulos, and V.J. Tsotras, 'On Indexing Mobile Objects,' PODS, 1999   DOI
8 Y. Tao and D. Papadias, 'MV3R-Tree: A Spatio Temporal Access Method for Timestamp and Interval Queries,' VLDB, 2001
9 Y. Tao and D. Papadias, 'Time-Parameterized Queries in Spatio-Temporal Databases,' ACM SIGMOD, 2002   DOI
10 O. Wolfson, S. Chamberlain, S. Dao, L. Jiang, and G. Mendez, 'Cost and Imprecision in Modeling the Position of Moving Objects,' ICDE, 1998
11 M. Stonebraker, J. Frew, K. Gardels, and J. Meredith, 'The SEQUOIA 2000 Storage Benchmark,' ACM SIGMOD, 1993   DOI   ScienceOn
12 K. Porkaew, I. Lazaridis, and S. Mehrotra, 'Querying Mobile Objects in Spatio-Temporal Databases,' SSTD, 2001
13 N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangle,' ACM SIGMOD, 1990   DOI
14 I. Kamel and C. Faloutsos, 'On Packing R-trees,' CIKM, 1993   DOI
15 Y. Theodoridis, E. Stefanakis, and T.K. Sellis, 'Efficient Cost Models for Spatial Queries Using R-Trees,' TKDE, Vol.12, No.1, pp. 19-32, 2000   DOI   ScienceOn
16 S. Acharya, V. Poosala, and S. Ramaswany, 'Selectivity Estimation in Spatial Databases,' ACM SIGMOD, 1999   DOI
17 S.T. Leutenegger and M.A. Lopez, 'The Effect of Buffering on the Performance of R-Trees,' TKDE, 2000   DOI   ScienceOn
18 P.B. Gibbons, Y. Matias, and V. Poosala, 'Fast Incremental Maintenance of Approximate Histograms,' VLDB, 1997
19 U. S. Bereau of Census, 'Tiger/lines precensus files: 1994 technical documentation,' Technical report, 1994