This Article 
 Bibliographic References 
 Add to: 
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
October 1995 (vol. 7 no. 5)
pp. 829-834

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.

[1] P.A. Bernstein and N. Goodman, "An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases," ACM Trans. Database Systems, vol. 9, no. 4, pp. 596-615, Dec. 1984.
[2] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[3] P.A. Bernstein, and N. Goodman,“Serializability Theory for replicated databases,” J. Computer and Systems Sciences, vol. 31, pp. 355-374, Dec. 1986.
[4] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in Partitioned Networks," ACM Computing Surveys, vol. 17, no. 3, pp. 341-370, Sept. 1985.
[5] M.H. Eich and S.H. Garad, “The Performance of Flow Graph Locking,” IEEE Trans. Software Eng., vol. 16, no. 4, pp. 477-483, Apr. 1990.
[6] M.H. Eich, "Graph Directed Locking," IEEE Trans. Software Eng. vol. 14, no. 2, p. 133, Feb. 1988.
[7] M.H. Eich and D.L. Wells,“Database concurrency control using data flow graphs,” ACM Trans. Database Systems, vol. 13, no. 2, pp. 197-227, June 1988.
[8] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[9] J.N. Gray, "Notes on Database Operating Systems" Operating Systems: An Advanced Course, R. Bayer, R.M. Graham, and G. Seegmuller, eds., Lecture Notes in Computer Science 60, Springer-Verlag, Heidelberg, Germany, 1978.
[10] S. Jajodia and D. Mutchler, “Dynamic Voting Algorithms for Maintaining the Consistency of a Database,” ACM Trans. Data Systems, vol. 15, no. 2, pp. 230-280, June 1990.
[11] N. Katoh, T. Ibaraki, and T. Kameda, ”Cautious Transaction Schedulers with Admission Control,” ACM Trans. Database Systems, vol. 10, no. 2, pp. 205-229, June 1985.
[12] P.K. Reddy and S. Bhalla, “Deadlock Prevention in a Distributed Database System,” SIGMOD Record, vol. 22, no. 3, pp. 40-46, Sept. 1993.
[13] A. Kumar and M. Stonebraker,“Semantics based transaction management techniques for replicated data,” ACM SIGMOD Annual Conf., pp. 117-125, 1988
[14] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[15] T. Minoura, and C. Wiederhold,“Resilient extended true-copy token scheme for a distributed databases,” IEEE Trans. Software Engineering, vol. 8, no. 3, pp. 173-189, May 1982.
[16] R. D. Schlichting and F. B. Schneider,“Fail-stop processors: An approach to designing fault-tolerant computing systems,”ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222–238, Aug. 1983.
[17] M. Singhal, “Update Transport: A New Technique for Update Synchronization in Replicated Database Systems,” IEEE Trans. Software Eng., vol. 16, pp. 1,325-1,336, 1990.
[18] M. Stonebraker,“Concurrency control and consistency in multiple copies of data in distributed INGRES,” IEEE Trans. Software Engineering, vol. 3, no. 3, pp. 188-194, May 1979.
[19] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.

Index Terms:
Availability, distributed algorithms, fault tolerance, nonblocking protocols, reliability, replicated databases, time-critical transactions, serializability.
P. Krishna Reddy, Subhash Bhalla, "A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 829-834, Oct. 1995, doi:10.1109/69.469835
Usage of this product signifies your acceptance of the Terms of Use.