Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
A consensus glossary of temporal database concepts
ACM SIGMOD Record
On the generation of aggregated random spatial regions
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Multidimensional access methods
ACM Computing Surveys (CSUR)
Overlapping linear quadtrees: a spatio-temporal access method
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Overlapping B+-trees: an implementation of a transaction time access method
Data & Knowledge Engineering
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
Survey of Spatio-Temporal Databases
Geoinformatica
Proceedings of the Second International Conference on Data Engineering
Processing of Spatio-Temporal Queries in Image Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Specifications for Efficient Indexing in Spatiotemporal Databases
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
Research in spatio-temporal databases has largely focused on extensions of access methods for the proper handling of time changing spatial information. In this paper, we present the Multiversion Linear Quadtree (MVLQ), a spatio-temporal access method based on Multiversion B-trees (MVBT) [2], embedding ideas from Linear Region Quadtrees [4]. More specifically, instead of storing independent numerical data having a different transaction-time each, for every consecutive image we store a group of codewords that share the same transaction-time, whereas each codeword represents a spatial subregion. Thus, the new structure may be used as an index mechanism for storing and accessing evolving raster images. We also conducted a thorough experimentation using sequences of real and synthetic raster images. In particular, we examined the time performance of temporal window queries, and provide results for a variety of parameter settings.