This Article 
 Bibliographic References 
 Add to: 
Can-Follow Concurrency Control
October 2007 (vol. 56 no. 10)
pp. 1425-1430
Peng Liu, IEEE
Jie Li, IEEE
Can-follow concurrency control permits a transactionto read (write) an item write-locked (read-locked) by anothertransaction with almost no delays. By combining the merits of2PL and 2V2PL, this approach mitigates the lock contention notonly between update and read-only transactions, but also betweenupdate and update transactions.

[1] D. Agrawal, A. El Abbadi, and R. Jeffers, “An Approach to Eliminate Transaction Blocking in Locking Protocols,” Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, June 1992.
[2] D. Agrawal, A. El Abbadi,, and A.E. Lang, “The Performance of Protocols Based on Locks with Ordered Sharing,” IEEE Trans. Knowledge and Data Eng., vol. 6, no. 5, pp. 805-818, Oct. 1994.
[3] P. Ammann, S. Jajodia, and P. Liu, “Recovery from Malicious Transactions,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 5, pp. 1167-1185, Sept./Oct. 2002.
[4] R. Bayer, H. Heller, and A. Reiser, “Parallelism and Recovery in Database Systems,” ACM Trans. Database Systems, vol. 5, no. 2, pp. 139-156, June 1980.
[5] P.A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[6] P.M. Bober and M.J. Carey, “Indexing for Multiversion Locking: Alternatives and Performance Evaluation,” IEEE Trans. Knowledge and Data Eng., vol. 9, no. 1, pp. 68-84, Jan./Feb. 1997
[7] H. Garcia-Molina and G. Wiederhold, “Read-Only Transactions in a Distributed Database,” ACM Trans. Database Systems, vol. 7, no. 2, pp.209-234, 1982.
[8] K. Manassiev, M. Mihailescu, and C. Amza, “Exploiting Distributed Version Concurrency in a Transactional Memory Cluster,” Proc. SIGPLAN Symp. Principles and Practice of Parallel Programming, Mar. 2006.
[9] C. Mohan, H. Pirahesh, and R. Lorie, “Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 124-133, 1992.
[10] H. Schuldt, G. Alonso, C. Beeri, and H.-J. Schek, “Atomicity and Isolation for Transactional Processes,” ACM Trans. Database Systems, vol. 27, no. 1, pp. 63-116, 2002.
[11] R.E. Stearns and D.J. Rosenkrantz, “Distributed Database Concurrency Controls Using Before-Values,” Proc. ACM SIGMOD Int'l Conf. Management of Data, Apr. 1981.
[12] Y.C. Tay, N. Goodman, and R. Suri, “Locking Performance in Centralized Databases,” ACM Trans. Database Systems, vol. 10, no. 4, pp. 415-462, Dec. 1985.
[13] A. Thomasian, “Concurrency Control: Methods, Performance, and Analysis,” ACM Computing Surveys, vol. 30, no. 1, pp. 70-119, Mar. 1998.
[14] M. Yu, P. Liu, and W. Zang, “Self Healing Workflow Systems under Attacks,” Proc. 24th IEEE Int'l Conf. Distributed Computing Systems, 2004.

Index Terms:
can follow, concurrency control, transaction processing
Peng Liu, Jie Li, Sushil Jajodia, Paul Ammann, "Can-Follow Concurrency Control," IEEE Transactions on Computers, vol. 56, no. 10, pp. 1425-1430, Oct. 2007, doi:10.1109/TC.2007.70761
Usage of this product signifies your acceptance of the Terms of Use.