This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Performance of Protocols Based on Locks with Ordered Sharing
October 1994 (vol. 6 no. 5)
pp. 805-818

There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of two-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.

[1] D. Agrawal and A. El Abbadi, "Constrained shared locks for increasing concurrency in databases," Tech. Rep. CS-90-14, Dept. of Comput. Sci., Univ. of California, Santa Barbara, CA, USA, 1990, to appear inJ. Comput. Syst. Sci.
[2] D. Agrawal and A. El Abbadi, "Locks with constrained sharing," inProc. 9th ACM Symp. Principles of Database Syst., 1990, pp. 85-93.
[3] R. Agrawal, M. J. Carey, and M. Linvy, "Concurrency control performance modelling: Alternatives and implications,"ACM Trans. Database Syst., vol. 12, pp. 609-654, Dec. 1987.
[4] R. Agrawal, M.J. Carey, and L. W. McVoy, "The performance of alternative strategies for dealing with deadlocks in database management systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 1348-1363, Dec. 1987.
[5] A. Aho, J. Hopcroft, and J. Ullman,Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
[6] B. R. Badrinath and K. Ramamritham, "Semantics-based concurrency control: Beyond commutativity,"ACM Trans. Database Syst., submitted for publication.
[7] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[8] P. A. Bernstein, D. W. Shipman, and W. S. Wong, "Formal aspects of serializability in database concurrency control,"IEEE Trans. Software Eng., vol. 5, no. 5, pp. 203-216, May 1979.
[9] M. Carey, "Modeling and evalution of concurrency control algorithms," Ph.D. dissertation, Univ. California at Berkeley, 1983.
[10] M. J. Carey, S. Krishnamurthi, and M. Livny, "Load control for locking: The 'half-and-half' approach," inProc. 9th ACM Symp. Principles of Database Syst., 1990, pp. 72-84.
[11] 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.
[12] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[13] J. N. Gray, "The transaction concept: Virtues and limitations," inProc. 7th Int. Conf. Very Large Data Bases, 1981, pp. 144-154.
[14] V. Hadzilacos, "A theory of reliability in database systems,"J. ACM, vol. 35, pp. 121-145, Jan. 1988.
[15] T. Haerder and A. Reuter, "Principles of transaction-oriented data-base recovery,"ACM Comput. Surveys, vol. 15, pp. 287-317, Dec. 1983.
[16] H. F. Korth, "Locking primitives in database systems,"J. ACM, vol. 30, pp. 55-79, Jan. 1983.
[17] A. Law and C. Larmey,An Introduction to Simulation Using SIMSCRIPT 11.5. Los Angeles, CA: CACI, 1984.
[18] C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, "ARIES: A transaction rccovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging," IBM Res. Rep. RJ6649, Jan. 1989, IBM Almaden Research Center, submitted toACM Trans. Database Syst..
[19] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[20] E. C. Russell,Building Simulation Models with SIMSCRIPT 11.5, CACI Inc., Los Angeles, 1983.
[21] E. C. Russell,SIMSCRIPT 11.5 Programming Language. Los Angeles, CA: CACI, 1987.
[22] A. Silberschatz and Z. Kedem, "Consistency in hierarchical database systems,"J. Ass. Comput. Mach., vol. 27, Jan. 1980.
[23] J. S. Verhofstad, "Recovery techniques for database systems,"Comput. Surveys, vol. 10, no. 2, pp. 167-195, 1978.

Index Terms:
concurrency control; protocols; performance evaluation; performance evaluation; protocols; ordered sharing; database workloads; system configurations; concurrency control; centralized database simulation model
Citation:
D. Agrawal, A. El Abbadi, A.E. Lang, "The Performance of Protocols Based on Locks with Ordered Sharing," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 805-818, Oct. 1994, doi:10.1109/69.317708
Usage of this product signifies your acceptance of the Terms of Use.