Abstract
Multidimensional file structures designed for storing point data can be used to store spatial objects if the objects can be transformed into и-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.
Cite
CITATION STYLE
Becker, L., Voigtmann, A., & Hinrichs, K. H. (1999). Temporal indexing with multidimensional file structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1677, pp. 1031–1040). Springer Verlag. https://doi.org/10.1007/3-540-48309-8_97
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
