Non-blocking concurrency control in distributed database systems

Author

Krishna Reddy, P. ; Bhall, Subhash

Author_Institution

Div. of Comput. Eng., Delhi Inst. of Technol., India

fYear

1995

fDate

15-17 Mar 1995

Firstpage

192

Lastpage

198

Abstract

Concurrency control based on conventional techniques requires additional efforts for deadlock detection and elimination. The possibility of a deadlock is also connected to the introduction of delays, and repeated restarts of transactions in deadlock cycles. In the proposed approach, a technique for generation of data flow precedence graphs among transactions at data sites has been studied. The local access graph approach is a fully distributed approach. Through local computations, the approach can prevent deadlocks in a distributed system

Keywords

concurrency control; data flow graphs; database theory; distributed databases; system recovery; transaction processing; data flow precedence graphs; data sites; deadlock cycles; deadlock detection; deadlock elimination; delays; distributed database systems; fully distributed approach; local access graph approach; local computations; nonblocking concurrency control; repeated transaction restarts; Concurrency control; Database systems; Degradation; Delay systems; Detection algorithms; Distributed computing; Distributed databases; Flow graphs; System recovery; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Algorithms/Architecture Synthesis, 1995. Proceedings., First Aizu International Symposium on

Conference_Location

Fukushima

Print_ISBN

0-8186-7038-X

Type

conf

DOI

10.1109/AISPAS.1995.401338

Filename

401338