1Research Scholar, Madan Mohan Malviya Engineering College, Gorakhpur, Uttar Pradesh, India. skt008@gmail.com
2Associate Professor, Madan Mohan Malviya Engineering College, Gorakhpur, Uttar Pradesh, India. akscse@rediffmail.com
3Research Scholar, Madan Mohan Malviya Engineering College, Gorakhpur, Uttar Pradesh, India. rsvsgkp@gmail.com
Online published on 21 November, 2017.
The Criteria for transaction consistency adopted for the management persistent replicated objects in a distributed system define the degree of concurrency allowed among operations accessing objects. Several notions of consistency are known from the literature among them are causal consistency causal serializability and serializability. After surveying and analyzing the available database models for replicated database, we propose a new transactional model for Hybrid transaction model to specialize the generalizing algorithm for concurrency control in a transaction system that exhibits a clean separation between policy and mechanism. A consistency criterion selected is manifested as a set of rules forming the policy. The mechanism however remains unchanged regardless of the currently used policy. It implements causally consistent message delivery and uses tokens and quorums of tokens to enforce access operation ordering according to the specified consistency criterion. An example of an application exploiting the advantages of dynamically switching among various consistency criteria concludes.
Replicated database, Data Access, Static and Dynamic Replication, Transaction, Hybrid Transaction, Lock Conflict, Distributed Real Time Databases