By Topic

A nonblocking transaction data flow graph based protocol for replicated databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. K. Reddy ; Div. Comput. Eng., Delhi Inst. of Technol., India ; S. Bhalla

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

Published in:

IEEE Transactions on Knowledge and Data Engineering  (Volume:7 ,  Issue: 5 )