Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Information Processing Letters
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The Time Index: An Access Structure for Temporal Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
M-IVTT: An Index for Bitemporal Databases
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Multidimensional file structures designed for storing point data can be used to store spatial objects if the objects can be transformed into n-dimensional points. We adapt this transformation technique to design a flexible indexing technique for temporal databases. This approach can be used to support valid-time, transaction-time, and bitemporal indices. The evaluation of various kinds of temporal selections on such indices is discussed, and we present an experimental comparison with an indexing technique for valid-time databases.