Using reconfiguration for efficient management of replicated data

IEEE Transactions on Knowledge and Data Engineering

Volumn 8, Issue 5, 1996, Pages 786-801

  Agrawal, Divyakant ^a,b   El Abbadi, Amr ^b  

^a IEEE

^b University of California   (United States)

Author keywords

Distributed databases; Fault tolerance; Reconfiguration; Replicated data

Indexed keywords

DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS;

DATA MANAGEMENT PROTOCOLS; REPLICATED DATA;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0030261837     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.542030     Document Type: Article

References (27)

1. D. Agrawal and A. El Abbadi, "The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data," Proc. 16th Int'l Conf. on Very Large Data Bases, pp. 243-254, Aug. 1990.
2. D. Agrawal and A. El Abbadi, "An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion," ACM Trans. Computer Systems, pp. 1-20, Feb. 1991.
3. D. Agrawal and A. El Abbadi, "The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data," ACM Trans. Database Systems, vol. 17, no. 4, pp. 689-717, Dec. 1992.
4. M. Ahamad and M.H. Ammar, "Performance Characterization of Quorum-Consensus Algorithms for Replicated Data," IEEE Trans. Software Eng., vol. 15, no. 4, pp. 492-495, Apr. 1989.
5. 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.
6. P.A. Bernstein and N. Goodman. "A Proof Technique for Concurrency Control and Recovery Algorithms for Replicated Databases," Distributed Computing, Springer-Verlag, vol. 2, no. 1, pp. 32-44, Jan. 1987.
7. S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Engineering, vol. 4, no. 6, pp. 582-592, Dec. 1992.
8. D. Davcev and W. Burkhard, "Consistency and Recovery Control for Replicated Files," Proc. 10th ACM Symp. Operating Systems Principles, pp. 87-96, Dec. 1985.
9. 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.
10. A. El Abbadi, D. Skeen, and F. Cristian, "An Efficient Fault-Tolerant Protocol for Replicated Data Management," Proc. Fourth ACM Symp. Principles of Database Systems, pp. 215-228, Mar. 1985.
11. A. El Abbadi and S. Toueg, "Maintaining Availability in Partitioned Replicated Databases," ACM Trans. Database Systems, vol. 14, no. 2, pp. 264-290, June 1989.
12. K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L,. Traiger, "The Notions of Consistency and Predicate Locks in a Database System," Comm. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
13. H. Garcia-Molina and D. Barbara, "How to Assign Votes in a Distributed System, J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
14. D.K. Gifford, "Weighted Voting for Replicated Data," Proc. Seventh ACM Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
15. J.N. Gray, "Notes on Database Systems," R. Bayer, R.M. Graham, and G. Seegmuller, eds., Operating Systems: An Advanced Course, Lecture Notes in Computer Science, vol. 60, pp. 393-481. Springer-Verlag, 1978.
16. M. Herlihy, "A Quorum-Consensus Replication Method for Abstract Data Types," ACM Trans. Computer Systems, vol. 4, no. 1, pp. 32-53, Feb. 1986.
17. M. Herlihy, "Dynamic Quorum Adjustments for Partitioned Data," ACM Trans. Database Systems, vol. 12, no. 2, pp. 170-194, June 1987.
18. S. Jajodia and D. Mutchler, "Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database." ACM Trans. Database Systems, vol. 15, no. 2, pp. 230-280, June 1990.
19. A. Kumar, "Hierarchical Quorum Consensus - A New Algorithm for Managing Replicated Data," IEEE Trans. Computers, vol. 39, no. 9, pp. 996-1,004, Sept. 1991.
20. A. Kumar and K. Malik, "Generalizing and Optimizing Hierarchical Quorum Consensus Algorithms for Replicated Data," Technical Report TR 91-05, Graduate School of Management, Cornell Univ., Oct. 1991.
21. M. Maekawa, "A √n Algorithm for Mutual Exclusion in Decentralized Systems," ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
22. J.F. Pâris and D.E. Long, "Efficient Dynamic Voting Algorithms," Proc. Fourth IEEE Int'l Conf. Data Eng., pp. 268-275, Feb. 1988.
23. M. Rabinovich and E.D. Lazowska, "Improving Fault-Tolerance and Supporting Partial Writes in Structured Coterie Protocols for Replicated Objects," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 226-236, May 1992.
24. M. Rabinovich and E.D. Lazowska, "The Dynamic Tree Protocol: Avoiding 'Graceful Degradation' in the Tree Protocol for Distributed Mutual Exclusion," IEEE Int'l Phoenix Conf. Computers and Comm., 1992.
25. R. Schlichting and F.B. Schneider, "Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems," ACM Trans. Computer Systems, vol. 1, no. 3, pp. 222-238, Aug. 1982.
26. M. Stonebraker, "Concurrency Control and Consistency in Multiple Copies of Data in Distributed INGRES," IEEE Trans. Software Eng., vol. 3, no. 3, pp. 188-194, May 1979.
27. R.H. Thomas, "A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases," ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.