Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions

@inproceedings{Mohan1992EfficientAF,
  title={Efficient and flexible methods for transient versioning of records to avoid locking by read-only transactions},
  author={C. Mohan and H. Pirahesh and R. Lorie},
  booktitle={SIGMOD '92},
  year={1992}
}
We present efficient and flexible methods which permit read-only transactions that do not mind reading a possibly slightly old, but still consistent, version of the data base to execute without acquiring locks. This approach avoids the undesirable interferences between such queries and the typically shorter update transactions that cause unnecessary and costly delays. Indexed access by such queries is also supported, unlike by the earlier methods. Old versions of records are maintained only in… Expand
An Efficient Transient Versioning Method
TLDR
The results of simulation experiments are presented that show that the method provides high transaction concurrency and supports queries almost as efficiently as the other transient-versioning methods, while incurring only a fraction of the storage overhead. Expand
Transient versioning for concurrency and recovery
TLDR
A new consistency method based on the notion of slices is developed, where a slice is a part of a transaction-consistent version of the database, which reduces synchronization overheads, simplify cache coherence, increase concurrency and support long-running queries. Expand
An Eecient Transient Versioning Method
High-performance database systems have to support ad-hoc queries while providing high transaction throughput. Transient versioning methods, where prior versions are maintained temporarily, areExpand
Dynamic finite versioning: an effective versioning approach to concurrent transaction and query processing
TLDR
Dynamic finite versioning schemes that effectively support concurrent processing of transaction and queries are presented and consistent logical snapshots can be advanced automatically without quiescing the ongoing transactions or queries. Expand
Reducing Database Locking Contention Through Multi-version Concurrency
TLDR
A novel kV-Indirection structure is described to enable efficient (parallelizable) optimistic and pessimistic multi-version concurrency control by utilizing the old versions of records to provide direct access to the recent changes of records without the need of temporal indexes. Expand
Logical and Physical Versioning in Main
We present a design for multi-version concur-rency control and recovery in a main memory database, and describe logical and physical versioning schemes that allow read-only transactions to executeExpand
Asynchronous version advancement in a distributed three version database
TLDR
The protocol creates no more than three versions of any data item, while guaranteeing that: update transactions never interfere with read-only transactions; the version advancement mechanism is completely asynchronous with (both update and read- only) user transactions; and reads do not acquire locks and write control information into the data items being read. Expand
Logical and Physical Versioning in Main Memory Databases
TLDR
The T-tree index structure (designed for main-memory databases) is extended to support concurrent access and latch-free traversals, and the performance benefits of the extensions are demonstrated. Expand
Towards practical multiversion locking techniques for on-line query processing
TLDR
The thesis describes how each successively weaker form of consistency can reduce query execution cost as well as version storage cost, and the results of simulation experiments are presented that quantify these cost reductions. Expand
Optimizing Active Database transactions Using an Extended Multiversion Concurrency Control Protocol
TLDR
This work proposes a slight extension of the classical multiversion two phase locking (MV2PL) protocol whereby these reads access versions and do not take locks, and proves the correctness of this protocol and shows that its implementation requires very few changes to classical implementations of MV2PL. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
On mixing queries and transactions via multiversion locking
TLDR
A novel approach to multiversion concurrency control that allows high-performance transaction systems to support long-running queries and has the potential for reducing the cost of versioning by grouping together queries to run against the same transaction-consistent view of the database is discussed. Expand
Implementing Distributed Read-Only Transactions
  • A. Chan, R. Gray
  • Computer Science
  • IEEE Transactions on Software Engineering
  • 1985
TLDR
An efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays and the recovery from transaction and system failures is greatly simplified and the taking of database dumps also can be accommodated while leaving the database on-line. Expand
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
TLDR
A method, called ARIESIIM (Algorithm for Recovery and Isolation Exploiting Semantics for Index Management), for concurrency control and recovery of B-trees and a subset of ARIES/IM has been implemented in the OS/2 Extended Edition Database Manager. Expand
ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes
TLDR
ARIESIKVL, by also using for key value locking the IX and SIX lock modes that were intended originally for table level locking, is able to better exploit the semantics of the operations to improve concurrency, compared to the System R index protocols. Expand
Distributed Version Management for Read-Only Actions
  • W. Weihl
  • Computer Science
  • IEEE Trans. Software Eng.
  • 1987
TLDR
This work presents four new concurrency control protocols that eliminate all interference between read-only actions and update actions, and thus offer significantly improved performance for read- only actions. Expand
The implementation of an integrated concurrency control and recovery scheme
TLDR
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. Expand
ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging
TLDR
ARIES is applicable not only to database management systems but also to persistent object-oriented languages, recoverable file systems and transaction-based operating systems. Expand
Naming and synchronization in a decentralized computer system
TLDR
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. Expand
Distributed database concurrency controls using before-values
TLDR
A careful distinction is made between design decisions concerning communications andDesign decisions concerning the responses to read/write requests, and two schemes for producing such controls are given. Expand
The Recovery Manager of the System R Database Manager
TLDR
The recovery subsystem of an experimental data management system is described and evaluated and the DO-UNDO-REDO protocol allows new recoverable types and operations to be added to the recovery system. Expand
...
1
2
3
...