An adaptive indexing technique using spatio-temporal query workloads

Many spatio-temporal access methods, such as the HR-tree, the 3DR-tree, and the MV3R-tree, have been proposed for timestamp and interval queries. However, these access methods have the following problems: the poor performance of the 3DR-tree for timestamp queries, the huge size and the poor performance of the HR-tree for interval queries, and the large size and the high update cost of the MV3R-tree. We address these problems by proposing an adaptive partitioning technique called the Adaptive Partitioned R-tree (APR-tree) using workloads with timestamp and interval queries. The APR-tree adaptively partitions the time domain using query workloads. Since the time domain of the APR-tree is automatically fitted to query workloads, the APR-tree outperforms the other access methods for various query workloads. The size of the APR-tree is on the average 1.3 times larger than that of the 3DR-tree which has the smallest size. The update cost of the APR-tree is on the average similar to that of the 3DR-tree which has the smallest update cost.

[1]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[2]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

[3]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[4]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[5]  Pankaj K. Agarwal,et al.  Indexing Moving Points , 2003, J. Comput. Syst. Sci..

[6]  Christian S. Jensen,et al.  Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.

[7]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[8]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[9]  Timos K. Sellis,et al.  A model for the prediction of R-tree performance , 1996, PODS.

[10]  Yannis Theodoridis,et al.  Evaluation of Access Structures for Discretely Moving Points , 1999, Spatio-Temporal Database Management.

[11]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[12]  Timos K. Sellis,et al.  Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

[13]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[14]  Dimitrios Gunopulos,et al.  Indexing Animated Objects Using Spatiotemporal Access Methods , 2001, IEEE Trans. Knowl. Data Eng..

[15]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[16]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[17]  Timos K. Sellis,et al.  Spatio-temporal composition and indexing for large multimedia applications , 1998, Multimedia Systems.

[18]  Yufei Tao,et al.  Efficient historical R-trees , 2001, Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001.

[19]  Pankaj K. Agarwal,et al.  Indexing moving points (extended abstract) , 2000, PODS '00.