This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Efficacy of Commutativity-Based Semantic Locking in a Real-World Application
March 2008 (vol. 20 no. 3)
pp. 427-431
While the dominant approach to persistent storage in practice is to use a relational DBMS, there are some specialist applications that rely on object stores. The performance of these applications depends on the efficiency of the object store's concurrency control mechanism. Today's predominant concurrency control mechanism is strict two-phase object locking. In the 80s, an interesting alternative was developed: commutativity-based semantic locking. In theory, it can outperform traditional locking schemes in certain scenarios with appropriate commutativity potential. In this paper, we study the real-world performance of different locking strategies in a particular industrial application from the telecommunications sector. We compare object-based locking and commutativity-based semantic locking. We found that, in this application, semantic locking performs equally to, but no better than, object locking in reasonable mixes of real-world transactions, and that it only outperforms in a deliberately contrived mix.

[1] D. Agrawal and A.E. Abbadi, “A Non-Restrictive Concurrency Control for Object Oriented Databases,” Proc. Int'l Conf. Extending Database Technology (EDBT '92), pp. 469-482, 1992.
[2] R. Agrawal, M.J. Carey, and M. Livny, “Concurrency Control Performance Modeling: Alternatives and Implications,” ACM Trans. Database Systems, vol. 12, no. 4, pp. 609-654, 1987.
[3] B. Badrinath and K. Ramamritham, “Semantic-Based Concurrency Control: Beyond Commutativity,” ACM Trans. Database Systems, vol. 17, no. 1, pp.163-199, 1992.
[4] B.R. Badrinath and K. Ramamritham, “Performance Evaluation of Semantics-Based Multilevel Concurrency Control Protocols,” Proc. ACM SIGMOD '90, pp. 163-172, 1990.
[5] M. Cart and J. Ferrié, “Integrating Concurrency Control into an Object-Oriented Database System,” Proc. Int'l Conf. Extending Database Technology (EDBT '90), pp. 363-377, 1990.
[6] J. Gray and A. Reuter, Transaction Processing—Concepts and Techniques. Morgan Kaufmann Publishers, 1993.
[7] S. Jajodia and R. Mukkamala, “Reduction in Transaction Conflicts Using Semantic-Based Concurrency Control,” Performance of Concurrency Control Mechanisms in Centralized Database Systems, pp. 387-405, Prentice-Hall, 1996.
[8] W. Jun and L. Gruenwald, “Semantic-Based Concurrency Control in Object-Oriented Databases,” J. Object-Oriented Programming, vol. 10, no. 8, pp. 33-39, 1998.
[9] C. Lécluse, P. Richard, and F. Velez, “O2, An Object-Oriented Data Model,” Proc. ACM SIGMOD '88, pp. 424-433, 1988.
[10] N. Lynch, M. Merritt, W. Weihl, and A. Fekete, Atomic Transactions. Morgan Kaufmann Publishers, 1994.
[11] C. Malta and J. Martinez, “Automating Fine Concurrency Control in Object-Oriented Databases,” Proc. Int'l Conf. Data Eng. (ICDE '93), pp. 253-260, 1993.
[12] P. Muth, T. Rakow, G. Weikum, P. Brossler, and C. Hasse, “Semantic Concurrency Control in Object-Oriented Database Systems,” Proc. Int'l Conf. Data Eng. (ICDE '93), pp. 233-242, 1993.
[13] R. Resende, D. Agrawal, and A.E. Abbadi, “Semantic Locking in Object-Oriented Database Systems,” Proc. Conf. Object-Oriented Programming Systems Languages and Applications (OOPSLA '94), pp. 388-402, 1994.
[14] P.M. Schwarz and A.Z. Spector, “Synchronizing Shared Abstract Types,” ACM Trans. Computer Systems, pp. 223-250, 1984.
[15] A. Thomasian, “Concurrency Control: Methods, Performance, and Analysis,” ACM Computing Surveys, vol. 30, no. 1, pp. 70-119, 1998.
[16] TPC Benchmark C Standard Specification, Transaction Processing Performance Council, Revision 5.2, http://www.tpc.orgtpcc/, 2003.
[17] W. Weihl, “Commutativity-Based Concurrency Control for Abstract Data Types,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1488-1505, Dec. 1988.
[18] G. Weikum and G. Vossen, Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann Publishers, 2001.
[19] P. Wu and A. Fekete, “An Empirical Study of Commutativity in Application Code,” Proc. Int'l Database Eng. and Applications Symp. (IDEAS '03), pp. 358-369, 2003.
[20] P. Wu, A. Fekete, and U. Röhm, “The Efficicacy of Commutativity-Based Semantic Locking in Real-World Application,” Technical Report 612, School of Information Technologies, Univ. of Sydney, Aug. 2007.
[21] S. Xavier and K. Ramamritham, “Implementation Considerations and Performance Evaluation of Object-Based Concurrency Control Protocols,” Performance of Concurrency Control Mechanisms in Centralized Database Systems, pp. 356-386, Prentice-Hall, 1996.

Index Terms:
Concurrency Control, Object-oriented Databases, Transaction Processing, Persistent Object Systems
Citation:
Paul Wu, Alan Fekete, Uwe Röhm, "The Efficacy of Commutativity-Based Semantic Locking in a Real-World Application," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 3, pp. 427-431, March 2008, doi:10.1109/TKDE.2007.190728
Usage of this product signifies your acceptance of the Terms of Use.