Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Computational geometry: an introduction
Computational geometry: an introduction
Information and Control
Searching and sorting similar lists
Journal of Algorithms
Computer
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
Hierarchical representations of collections of small rectangles
ACM Computing Surveys (CSUR)
Extending relational algebra to manipulate temporal data
Information Systems
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
A temporal relational model and a query language
Information Sciences: an International Journal
The time index—an access structure for temporal data
Proceedings of the sixteenth international conference on Very large databases
Toward a unified framework for version modeling in engineering databases
ACM Computing Surveys (CSUR)
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Version management of composite objects in CAD databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Managing the history of dynamic data structures
Managing the history of dynamic data structures
A consensus glossary of temporal database concepts
ACM SIGMOD Record
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Journal of the ACM (JACM)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
Proceedings of the Eighth International Conference on Data Engineering
Efficient Algorithms for Managing the History of Evolving Databases
ICDT '90 Proceedings of the Third International Conference on Database Theory
On Optimal Multiversion Access Structures
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Supporting Temporal Views in a ManagementInformation Base
Journal of Network and Systems Management
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
Database Versions to Represent Bitemporal Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Representing and querying histories of semistructured databases using multidimensional OEM
Information Systems - Special issue: ADBIS 2002: Advances in databases and information systems
An efficient method for temporal aggregation with range-condition attributes
Information Sciences—Informatics and Computer Science: An International Journal
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
| Hi-index | 0.00 |
Efficiently managing the history of a time-evolving system is one of the central problems in many database environments, like database systems that incorporate versioning, or object-oriented databases that implicitly or explicitly maintain the history of persistent objects. In this paper we propose algorithms that reconstruct past states of an evolving system for two general cases, i.e., when the system驴s state is represented by a set or by a hierarchy (a forest of trees). Sets are widely used as a canonical form of representing information in databases or program states. For more complex applications, like schema evolution in object-oriented databases, it becomes necessary to manage the history of data structures that have the form of forests or even graphs. The proposed algorithms use minimal space (proportional to the number of changes occurring in the evolution) and have the advantage of being on-line (in the amortized sense). Any past system state s(t) is reconstructed in time O(|s(t)|+ loglogT), where |s(t)| is the size of the answer and T is the maximal evolution time. For all practical cases the loglogT factor is a constant, therefore our algorithms provide almost random access to any past system state. Moreover, we show that the presented algorithms are optimal among all algorithms that use space linear in the number of changes in the system驴s evolution.