Overlapping linear quadtrees: a spatio-temporal access method

Overlapping is a technique used in access methods to combiie consecutive structure instances into a single structure by not storing identical sub-stmctnres. This way, space is saved without sacrificing time performance. Here, we present the structure of Overlapping Linear Quadtrees -which is used to store consecutive rader images according to transaction tim~ Experimentation with synthetic region data shows that considerable storage is saved in comparison to independent linear quadtre~~, in the case of similar consecutive images. Therefore, this stmcture can be used in spati~ temporal databases to support. query processing of evolving images. Besides, an efficient aIgorithm that uses the new structure and answers spatio-temporal window queries is presented.

[1]  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'.

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

[3]  Mario A. Nascimento,et al.  An Introductory Survey to Indexing Techniques for Temporal Databases , 1995 .

[4]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

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

[6]  Yannis Manolopoulos,et al.  Overlapping quadtrees for the representation of similar images , 1993, Image Vis. Comput..

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

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

[9]  F. Warren Burton,et al.  Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files , 1990, Comput. J..

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

[11]  Michael F. Worboys,et al.  A Unified Model for Spatial and Temporal Information , 1994, Comput. J..

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

[13]  Yannis Manolopoulos,et al.  Efficiency Analysis of Overlapped Quadtrees , 1995, Nord. J. Comput..

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

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

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

[17]  J. H. Jou,et al.  Improving the differential file technique via batch operations for tree structured file organizations , 1986, 1986 IEEE Second International Conference on Data Engineering.

[18]  Yannis Manolopoulos,et al.  On the generation of aggregated random spatial regions , 1995, CIKM '95.

[19]  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.

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

[21]  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).

[22]  Sheau-Dong Lang,et al.  Improving the Differential File Technique via Batch Operations for Tree Structured File Organizations , 1986, ICDE.

[23]  F. Warren Burton,et al.  Multiple Generation Text Files Using Overlapping Tree Structures , 1985, Comput. J..

[24]  A. Guttmma,et al.  R-trees: a dynamic index structure for spatial searching , 1984 .