Benchmarking access methods for time-evolving regional data

In this paper we present a performance comparison of access methods for time-evolving regional data. Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster Images and Overlapping Linear Quadtrees. These methods comprise a family of specialized access methods that can efficiently store and manipulate consecutive raster images. A new simpler implementation solution that provides efficient support for spatio-temporal queries referring to the past through these methods, is suggested. An extensive experimental space and time performance comparison of all the above access methods follows. The comparison is made under a common and flexible benchmarking environment in order to choose the best technique depending on the application and on the image characteristics. These experimental results show that in most cases the Overlapping Linear Quadtrees method is the best choice.

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

[2]  Ramez Elmasri,et al.  A consensus glossary of temporal database concepts , 1994, SGMD.

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

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

[5]  Arie Segev,et al.  A consensus glossary of temporal database concepts , 1994, SIGMOD 1994.

[6]  Nectaria Tryfona,et al.  Spatio-Temporal Databases: The CHOROCHRONOS Approach , 2003 .

[7]  David B. Lomet,et al.  The performance of a multiversion access method , 1990, SIGMOD '90.

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

[9]  Christian S. Jensen,et al.  On the Semantics of Now in Temporal Databases , 1994 .

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

[11]  Timos K. Sellis,et al.  Specifications for efficient indexing in spatiotemporal databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[12]  Rakesh M. Verma,et al.  An Efficient Multiversion Access STructure , 1997, IEEE Trans. Knowl. Data Eng..

[13]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[14]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[15]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[16]  Kotagiri Ramamohanarao,et al.  Guidelines for presentation and comparison of indexing techniques , 1996, SGMD.

[17]  Yannis Manolopoulos,et al.  Multiversion Linear Quadtree for Spatio-Temporal Data , 2000, ADBIS-DASFAA.

[18]  David B. Lomet,et al.  Access methods for multiversion data , 1989, SIGMOD '89.

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

[20]  Yannis Manolopoulos,et al.  Overlapping Linear Quadtrees and Spatio-Temporal Query Processing , 2000, Comput. J..

[21]  Ann Q. Gates,et al.  TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING , 2005 .

[22]  Yannis Manolopoulos,et al.  Overlapping B+trees for temporal data , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[23]  Christian S. Jensen,et al.  On the semantics of “now” in databases , 1996, TODS.

[24]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[25]  Hanan Samet,et al.  Applications of spatial data structures - computer graphics, image processing, and GIS , 1990 .

[26]  Yannis Manolopoulos,et al.  Time split linear quadtree for indexing image databases , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[27]  Yannis Manolopoulos,et al.  On the Generation of Time-Evolving Regional Data* , 2002, GeoInformatica.

[28]  Eiji Kawaguchi,et al.  On a Method of Binary-Picture Representation and Its Application to Data Compression , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Andrew U. Frank,et al.  Spatio-Temporal Databases , 2003, Lecture Notes in Computer Science.

[30]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[31]  Yannis Manolopoulos,et al.  Overlapping B+-Trees: An Implementation of a Transaction Time Access Method , 1999, Data Knowl. Eng..

[32]  Bernhard Seeger,et al.  Efficient temporal join processing using indices , 2002, Proceedings 18th International Conference on Data Engineering.

[33]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .