This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Group Paradigm for Concurrency Control Protocols
September 1989 (vol. 1 no. 3)
pp. 376-386

The authors propose a paradigm for developing, describing, and proving the correctness of concurrency control protocols for replicated databases in the presence of failures or communication restrictions. The approach used is to hierarchically divide the problem of achieving one-copy serializability by introducing the notion of a 'group' that is a higher level of abstraction than transactions. Instead of dealing with the overall problem, the paradigm breaks it into two simpler ones: (1) a local policy for each group that ensures a total order of all transactions in that group; and (2) a global policy that ensures a correct serialization of all groups. The paradigm is used to demonstrate the similarities between several concurrency control protocols by comparing the way they achieve correctness.

[1] P. Bernstein, D. Shipman, and B. Rothnie, "Concurrency control in a system for distributed database,"ACM Trans. Database Syst., vol. 5, no. 1, pp. 18-51, Mar. 1980.
[2] P. A. Bernstein and N. Goodman, "The failure and recovery problem for replicated databases," inProc. 2nd Ann. Symp. Principles of Distributed Computing, 1983, pp. 114-122.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[4] B. Coan, B. Oki, and E. Kolodner, "Limitations on database availability when networks partitions," inProc. 5th ACM Symp. Princ. Distributed Comput., Calgary, Alta., Canada, Aug. 1986, pp. 63-72.
[5] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341-370.
[6] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[7] A. El Abbadi and S. Toueg, "Availability in partitioned replicated databases," inProc. 5th ACM Symp. Principles of Database Systems, 1986, pp. 240-251.
[8] A. El Abbadi, "A paradigm for concurrency control protocols for distributed databases," Ph.D. dissertation, Dep. Comput. Sci., Cornell Univ., Tech. Rep. 87-853, Aug. 1987.
[9] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[10] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[11] M. Herlihy, "Dynamic quorum adjustment for partitional data,"ACM Trans. Database Syst., vol. 12, no. 2, pp. 170-194, June 1987.
[12] E. Moss, "Nested transactions and reliable distributed computing," in2nd IEEE Symp. Reliability in Distributed Software and Database Syst., July 1982.
[13] D. P. Reed, "Implementing atomic actions on decentralized data,"ACM Trans. Comput. Syst., vol. 1, pp. 3-23, Feb. 1983.
[14] D. Skeen and D. Wright, "Increasing availability in partitioned networks," inProc. 3rd ACM SIGACT-SIGMOD Symp. Principles of Database Syst., Waterloo, Ont., Canada, Apr. 1984, pp. 290-299.
[15] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.
[16] J. D. Ullman,Principles of Databases Systems. Rockville, MD: Computer Science Press, 1982.

Index Terms:
group paradigm; concurrency control protocols; proving the correctness; replicated databases; abstraction; serialization; concurrency control; distributed databases; fault tolerant computing; protocols
Citation:
A. El Abbadi, S. Toueg, "The Group Paradigm for Concurrency Control Protocols," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 3, pp. 376-386, Sept. 1989, doi:10.1109/69.87982
Usage of this product signifies your acceptance of the Terms of Use.