A Study of the Concurrency Control and Recovery Algorithms in Nested Transaction Environment

@article{Madria1997ASO,
  title={A Study of the Concurrency Control and Recovery Algorithms in Nested Transaction Environment},
  author={Sanjay Kumar Madria},
  journal={Comput. J.},
  year={1997},
  volume={40},
  pages={630-639}
}
  • S. Madria
  • Published 1997
  • Computer Science
  • Comput. J.
In this paper, we present a study on the concurrency control and recovery algorithms in nested transaction environment. We have reviewed the work done in the area of nested transaction modelling, its applications in object-oriented and mobile databases, and in workflow models. We have contrasted various nested transaction models by discussing their advantages and disadvantages. We have outlined some important future research directions in the area of nested transaction processing. 
Speculation based nested locking protocol to increase the concurrency of nested transactions
  • P. K. Reddy, M. Kitsuregawa
  • Computer Science
    Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789)
  • 2000
The authors propose an improved concurrency control protocol based on speculation for nested transactions and explain how it increases both intraand inter-transaction concurrency as compared to
Performance modeling of nested transactions in database systems
TLDR
A detailed simulation model is developed and several experiments are conducted to measure the impact of transactions characteristics on the performance of nested transactions.
SPECULATION TO INCREASE THE CONCURRENCY OF NESTED TRANSACTIONS
We have proposed an improved concurrency control protocol for nested transactions based on speculation. In the proposed speculative nested locking (SNL) protocol, whenever a sub-transaction finishes
An efficient real-time scheduler for nested transaction models
  • Hong-Ren Chen, Y. Chin
  • Computer Science
    Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings.
  • 2002
TLDR
An efficient real-time scheduler consisting of a priority assignment policy called FHRN to schedule real- time nested transactions, and a lock mechanism called 2PL-HPN to resolve the data conflict problem among nested transactions for distributed RTDBS using nested transaction models is presented.
Effects of shaping characteristics on the performance of nested transactions
TLDR
A detailed simulation model is developed and the effect of the number of leaves on the performance of nested transactions is investigated under different shaping parameters and effects of the depth of the transaction tree on the system performance are investigated.
Design and Implementation of Linear Hash Algorithm in a Nested Transaction Environment
TLDR
A design and implementation of a linear hashing algorithm in nested transaction environment to handle large amount of data and design a client/server model using layered system architecture that provides more concurrency and efficient recovery.
1 DESIGN AND IMPLEMENTATION OF LINEAR HASH STRUCTURES IN NESTED TRANSACTIONS ENVIRONMNET
In this paper, we present formalization and an implementation of a linear hashing algorithm in nested transaction environment to handle large amount of data with increased concurrency. Nested
Transactions and Database Dynamics
TLDR
The paper derives criteria and practical protocols for guaranteeing global snapshot isolation at the federation level and generalizes the well-known ticket method to cope with combinations of isolation levels in a federated system.
On the Correctness of a Transaction Model for Mobile Computing
TLDR
It is proved that the correctness of a transaction model for mobile computing, which includes a prewrite operation which does not update the state of a data object but makes visible the value that the data object will have after the commit of the transaction, is correct.
Nested Transactions with Integrity Constraints
TLDR
The main idea of the solution is to attach the checking of a constraint to the smallest common ancestor of the sub-transactions which could violate the constraint.
...
1
2
...

References

SHOWING 1-10 OF 92 REFERENCES
Concurrency control of nested transactions accessing B-trees
This paper presents a concurrency control algorithm for nested transactions accessing B-trees. It combines the idea of B-link tree with that of resilient 2-phase locking [Mos85b]. The I/O automaton
Abstraction in Concurrency Control and Recovery Management
TLDR
A model of multi-layers of inertia is examined to provide the high data INTEGRITY of RELIABLE DATABASE TRANSACTION PROCESSing in a broader class of information systems.
A Theory of Timestamp-Based Concurrency Control for Nested Transactions
TLDR
A rigorous framework for analyzing timestampbased concurrency control and recovery algorithms for nested transactions is presented and it is shown that local static atomicity of each object is sufficient to ensure global serializability.
Transaction management in an object-oriented database system
In this paper, we describe transaction management in ORION, an object-oriented database system. The application environments for which ORION is intended led us to implement the notions of sessions of
Atomic Transactions
  • B. Lampson
  • Computer Science
    Advanced Course: Distributed Systems
  • 1980
We have defined a facility (transactions) which clients can use to perform complex updates to distributed data in a manner which maintains consistency in the presence of system crashes and
Semantic concurrency control in object-oriented database systems
TLDR
A locking protocol for object-oriented database systems (OODBSs) is presented and it is shown that, using the locking protocol in an open-nested transaction, the locks of a subtransactions are released when the subtransaction completes, and only a semantic lock is held further by the parent of the subTransaction.
Granularity of Locks and Degrees of Consistency in a Shared Data Base
TLDR
A locking protocol which allows simultaneous locking at various granularities by different transactions is presented, based on the introduction of additional lock modes besides the conventional share mode an5 exclusive mode.
The impact of recovery on concurrency control
TLDR
This paper considers two general recovery methods for abstract data types, update-in-place and deferred-update, and gives a precise characterization of the conflict relations that work with each recovery method, and shows that each permits conflict Relations that the other does not.
Nested Transactions: An Approach to Reliable Distributed Computing
TLDR
The method for implementing nested transactions is novel in that it uses locking for concurrency control and the necessary algorithms for locking, recovery, distributed commitment, and distributed deadlock detection for a nested transaction system are presented.
Nested transactions and read-write locking
TLDR
This proof extends earlier work on exclusive locking to prove that Moss's algorithm generates serially correct executions in the presence of concurrency and transaction aborts.
...
1
2
3
4
5
...