scispace - formally typeset
Proceedings ArticleDOI

Reliable transaction management in a multidatabase system

Reads0
Chats0
TLDR
A fault tolerant transaction management algorithm and recovery procedures that retain global database consistency are designed and shown that their algorithms ensure freedom from global deadlocks of any kind.
Abstract
A model of a multidatabase system is defined in which each local DBMS uses the two-phase locking protocol Locks are released by a global transaction only after the transaction commits or aborts at each local site. Failures may occur during the processing of transactions. We design a fault tolerant transaction management algorithm and recovery procedures that retain global database consistency. We also show that our algorithms ensure freedom from global deadlocks of any kind.

read more

Citations
More filters

Multidatabase Atomic Commitment Protocols: A Taxonomy and Unified Appr oach

TL;DR: A taxonomy of multidatahase atomic commitment mcthods is provided and this taxonomy is used to devclop a subtransaction taxonomy, which is used in conjunction with an execution model to define the types ofMultidatabasc transactions that arc committablc, and to construct a unified multid atabasc atomic commitment protocol.
Proceedings ArticleDOI

A priority-based PCG algorithm for global deadlock detection and resolution in multidatabase systems

TL;DR: The paper presents a priority-based potential conflict graph algorithm for global deadlock-detection in a multidatabase system that extends the previous PCG algorithm by examining the following problems: unnecessary aborts, inefficient victim selections, and false deadlock reports.
Proceedings ArticleDOI

Concurrency control for federated multilevel secure database systems

I.E. Kang, +1 more
TL;DR: A concurrency control protocol for transaction processing in federated MLS database systems that ensures global serializability but requires that the security lattice at each local site be totally ordered, however, the union of each local lattice can be partially ordered.

A Unifying Approach to Hierarchical Transaction Management in Multidatabase Systems

TL;DR: An approach to the correct execution of both global and local transactions without violation of local autonomy is offered and local extensibility is proposed as a unifying principle in the combination ofglobal and local transaction management.
Journal ArticleDOI

Confronting database complexities

TL;DR: Database technology is exploding, as the hierarchical and relational models give way to object-oriented, distributed heterogeneous, and other kinds of specialized models.
References
More filters
Journal ArticleDOI

The notions of consistency and predicate locks in a database system

TL;DR: It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
Book

Database System Concepts

TL;DR: This acclaimed revision of a classic database systems text provides the latest information combined with real-world examples to help readers master concepts in a technically complete yet easy-to-understand style.
Book ChapterDOI

Notes on Data Base Operating Systems

Jim Gray
TL;DR: 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.
Journal ArticleDOI

System level concurrency control for distributed database systems

TL;DR: In this article, the authors present designs for several distributed concurrency controls and demonstrates that they work correctly and investigates some of the implications of global consistency of a distributed database and discusses phenomena that can prevent termination of application programs.
Book ChapterDOI

System Level Concurrency Control for Distributed Database Systems

TL;DR: In this paper, the authors present designs for several distributed concurrency controls and demonstrates that they work correctly and investigates some of the implications of global consistency of a distributed database and discusses phenomena that can prevent termination of application programs.