Title :
A nonblocking transaction data flow graph based protocol for replicated databases
Author :
Reddy, P. Krishna ; Bhalla, Subhash
Author_Institution :
Div. Comput. Eng., Delhi Inst. of Technol., India
fDate :
10/1/1995 12:00:00 AM
Abstract :
Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches rely on obtaining votes from other sites for processing update requests. In the proposed approach, a technique for generation of precedence graphs for each transaction execution is analyzed. The transaction data flow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions
Keywords :
concurrency control; data flow graphs; distributed databases; memory protocols; replicated databases; transaction processing; distributed algorithms; fault tolerance; nonblocking protocols; nonblocking transaction data flow graph based protocol; one-copy serializability criteria; precedence graphs; reliability; replicated databases; time-critical transactions; transaction execution; update requests; Cognitive science; Councils; Data analysis; Data engineering; Flow graphs; Machine learning; Proposals; Protocols; Transaction databases; Voting;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
