Comparison of access methods for time-evolving data
- 1 June 1999
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 31 (2), 158-221
- https://doi.org/10.1145/319806.319816
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- An asymptotically optimal multiversion B-treeThe VLDB Journal, 1996
- Historical queries along multiple lines of time evolutionThe VLDB Journal, 1995
- Efficient management of time-evolving databasesIEEE Transactions on Knowledge and Data Engineering, 1995
- The Snapshot Index: An I/O-Optimal access method for timeslice queriesInformation Systems, 1995
- External segment treesAlgorithmica, 1994
- Using differential technlques to efficiently support transaction timeThe VLDB Journal, 1993
- A temporal relational model and a query languageInformation Sciences, 1989
- Extending relational algebra to manipulate temporal dataInformation Systems, 1988
- Partitioned storage for temporal databasesInformation Systems, 1988
- An efficient I/O interface for optical disksACM Transactions on Database Systems, 1985