This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Locking Protocols for Materialized Aggregate Join Views
June 2005 (vol. 17 no. 6)
pp. 796-807
The maintenance of materialized aggregate join views is a well-studied problem. However, to date the published literature has largely ignored the issue of concurrency control. Clearly, immediate materialized view maintenance with transactional consistency, if enforced by generic concurrency control mechanisms, can result in low levels of concurrency and high rates of deadlock. While this problem is superficially amenable to well-known techniques, such as fine-granularity locking and special lock modes for updates that are associative and commutative, we show that these previous high concurrency locking techniques do not fully solve the problem, but a combination of a "value-based” latch pool and these previous high concurrency locking techniques can solve the problem.

[1] P.A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[2] B.R. Badrinath and K. Ramamritham, “Semantics-Based Concurrency Control: Beyond Commutativity,” ACM Trans. Database Systems, vol. 17, no. 1, pp. 163-199, 1992.
[3] D. Gawlick and D. Kinkade, “Varieties of Concurrency Control in IMS/VS Fast Path,” IEEE Database Eng. Bull., vol. 8, no. 2, pp. 3-10, 1985.
[4] J. Gehrke, F. Korn, and D. Srivastava, “On Computing Correlated Aggregates over Continual Data Streams,” Proc. SIGMOD, pp. 13-24, 2001.
[5] J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total,” Proc. Int'l Conf. Data Eng., pp. 152-159, 1996.
[6] J. Gray, R.A. Lorie, G.R. Putzolu, and I.L. Traiger, “Granularity of Locks and Degrees of Consistency in a Shared Data Base,” Proc. IFIP Working Conf. Modeling in Data Base Management Systems, pp. 365-394, 1976.
[7] A. Gupta and I.S. Mumick, Materialized Views: Techniques, Implementations, and Applications. MIT Press, 1999.
[8] J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
[9] A. Kawaguchi, D.F. Lieuwen, I.S. Mumick, D. Quass, and K.A. Ross, “Concurrency Control Theory for Deferred Materialized Views,” Proc. Int'l Conf. Database Theory, pp. 306-320, 1997.
[10] H.F. Korth, “Locking Primitives in a Database System,” J. ACM, vol. 30, no. 1, pp. 55-79, 1983.
[11] W. Labio, J. Yang, Y. Cui, H. Garcia-Molina, and J. Widom, “Performance Issues in Incremental Warehouse Maintenance,” Proc. Very Large Data Bases Conf., pp. 461-472, 2000.
[12] G. Luo, J.F. Naughton, C.J. Ellmann, and M.W. Watzke, “Locking Protocols for Materialized Aggregate Join Views,” Proc. Very Large Data Bases Conf., pp. 596-607, 2003.
[13] P.E. O'Neil, “The Escrow Transactional Method,” ACM Trans. Database Systems, vol. 11, no. 4, pp. 405-430, 1986.
[14] M. Poess and C. Floyd, “New TPC Benchmarks for Decision Support and Web Commerce,” SIGMOD Record, vol. 29, no. 4, pp. 64-71, 2000.
[15] R.F. Resende, D. Agrawal, and A.E. Abbadi, “Semantic Locking in Object-Oriented Database Systems,” Proc. Conf. Object-Oriented Programming Systems, Languages, and Applications, pp. 388-402, 1994.
[16] A. Reuter, “Concurrency on High-Traffic Data Elements,” Proc. ACM Symp. Principles of Database Systems, pp. 83-92, 1982.
[17] A. Silberschatz and Z.M. Kedem, “Consistency in Hierarchical Database Systems,” J. ACM, vol. 27, no. 1, pp. 72-80, 1980.

Index Terms:
Concurrency, relational databases, transaction processing.
Citation:
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Michael W. Watzke, "Locking Protocols for Materialized Aggregate Join Views," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 796-807, June 2005, doi:10.1109/TKDE.2005.96
Usage of this product signifies your acceptance of the Terms of Use.