Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Overlapping B+trees for temporal data
JCIT Proceedings of the fifth Jerusalem conference on Information technology
A consensus glossary of temporal database concepts
ACM SIGMOD Record
Guidelines for presentation and comparison of indexing techniques
ACM SIGMOD Record
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
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)
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
An effective way to represent quadtrees
Communications of the ACM
Overlapping linear quadtrees and spatio-temporal query processing
The Computer Journal
On the Generation of Time-Evolving Regional Data
Geoinformatica
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
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
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Efficient Temporal Join Processing Using Indices
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
Spatio-Temporal Databases
A spatio-temporal geometry-based model for digital documentation of historical living systems
Information and Management
A benchmark for evaluating moving object indexes
Proceedings of the VLDB Endowment
BerlinMOD: a benchmark for moving object databases
The VLDB Journal — The International Journal on Very Large Data Bases
The COST benchmark—comparison and evaluation of spatio-temporal indexes
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Hi-index | 0.00 |
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.