Integration of Time Versions into a Relational Database System
Very Large Data BasesPublished 27 August 1984
Peter Dadam, Vincent Y. Lum, H Werner
Citations93
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents the design considerations for a database system currently under implementation, that integrates time version support as a normal database function.
Abstract
New application areas for database systems, such as office automation and CAD/CAM will require to support not only access to the current data, as is done in current database systems, but also to previous instances of the data (versions). This means that time version support is needed. This paper presents the design considerations for a database system currently under implementation, that integrates time version support as a normal database function. It is shown that many subtle issues, such as choice of a suitable timestamp, how to store history data in a compact form, how to integrate version management into update processing, recovery, concurrency control, etc., have to be considered together to obtain an optimal design.
Keywords
Computer ScienceDecision Sciences
Lecture notes in computer scienceNotes on data base operating systems
1,652 Citations1978Jim Gray
This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.
ACM Transactions on Database SystemsOn optimistic methods for concurrency control
1,439 Citations1981H. T. Kung, John T. Robinson
In this paper, two families of nonlocking concurrency controls are presented and the methods used are "optimistic" in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between transactions will not occur.
ACM Transactions on Database SystemsA Majority consensus approach to concurrency control for multiple copy databases
1,006 Citations1979Robert Thomas
A “majority consensus” algorithm which represents a new solution to the update synchronization problem for multiple copy databases is presented and can function effectively in the presence of communication and database site outages.
IBM Journal of Research and DevelopmentSEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
521 Citations1976Donald D. Chamberlin, M. M. Astrahan +6 more
SEQUEL 2 is a relational data language that provides a consistent, English keyword-oriented set of facilities for query, data definition, data manipulation, and datac ontrol.
ACM Transactions on Database SystemsMultiversion concurrency control—theory and algorithms
490 Citations1983Philip A. Bernstein, Nathan Goodman
Remarks on the algebra of non first normal form relations
355 Citations1982Gerhard Jaeschke, Hans‐Jörg Schek
An extension of the relational model is proposed consisting of Non First Normal Form (NF2) relations, enriched mainly by so called nest and unnest operations which transform between NF2 relations and the usual ones.
DSpace@MIT (Massachusetts Institute of Technology)NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
326 Citations1978David P. Reed
A new approach to the synchronization of accesses to shared data objects is developed, called NAMOS, which provides a useful tool for restoring a consistent state of the system after a failure resulting in irrecoverable loss of information or a user mistake resulting in an inconsistent state.
ACM Transactions on Database SystemsPhysical integrity in a large segmented database
255 Citations1977Raymond A. Lorie
A recovery scheme is first proposed for system failure (hardware or software error which causes the contents of main storage to be lost) and a facility for protection against damage to the auxiliary storage itself is proposed.
On extending the functions of a relational database system
251 Citations1982Roger Haskin, Raymond A. Lorie
Additions to System R, a prototypical relational system, are introduced to satisfy demands: long fields, for storing non-coded data, and complex objects, which declare the semantic relationships among data items and provide a means for adequately supporting interactive access.
ACM Transactions on Database SystemsIntroduction to a system for distributed databases (SDD-1)
249 Citations1980James B. Rothnie, P. A. Bernstein +7 more
This paper presents an overview of the SDD-1 design and its solutions to the above problems.
IEEE Transactions on Software EngineeringFormal Aspects of Serializability in Database Concurrency Control
241 Citations1979P.A. Bernstein, David W. Shipman +1 more
It is shown why locking mechanisms lead to correct operation, it is shown that two proposed mechanisms for distributed environments are special cases of locking, and a new version of lockdng is presented that alows more concurrency than past methods.
ACM Transactions on Database SystemsParallelism and recovery in database systems
189 Citations1980Raymond Bayer, Hans Heller +1 more
It is proved that transactions executed according to a certain scheme by which readers and writers may work simultaneously on the same object have the correct effect; i.e., consistency is preserved.
The implementation of an integrated concurrency control and recovery scheme
144 Citations1982Arvola Chan, Stephen Fox +3 more
An efficient garbage collection algorithm for reclaiming storage space used by old versions of data objects that will no longer be accessed is presented and an on-line backup algorithm that will permit the backup procedure to run in parallel with regular transactions is proposed.
ACM Transactions on Database SystemsOn Concurrency Control by Multiple Versions
120 Citations1984Christos H. Papadimitriou, Paris C. Kanellakis
The limit of the parallelism achievable by the multiversion approach is characterized and the resulting space-parallelism trade-off is demonstrated.
IBM Systems JournalGeneralized audit trail requirements and concepts for data base applications
38 Citations1975Lawrence A. Bjork
This paper hypothesizes what information must be retained in the audit trail to permit recovery and audit later in time and a scheme of organizing the contents of the Audit trail so as to provide the required functions at minimum overhead.
Information SystemsFormal aspects of optimistic concurrency control in a multiple version database system
23 Citations1983Georg Lausen
The underlying decision problems of serializability are defined and shown to be NP-complete in a model, which is typical for most modern transaction oriented database management systems and it is most probable that both optimistic concurrency control types cannot be implemented efficiently in the general case.