Author:
Swati ,Bajaj Shalini Bhaskar,Jaglan Vivek
Reference17 articles.
1. Aries D, Stonebraker M (1979) Locking granularity revisited. ACM Trans Database Syst 4(2):210–227
2. Chatterjee B, Nguyen N, Tsigas P (2014) Efficient lock free binary search trees. In: Proceedings of the 2014 ACM symposium on principles of distributed computing (PODC’14) ACM, New York, pp 322–331
3. Bhan U, Chandra R (2012) The impact of multiple granularity on concurrency control in multi user environment. J Inform Oper Manage 3(1):289–292
4. Desai N, Mueller F (2004) Scalable distributed concurrency services for hierarchical locking. In: Proceedings of the IEEE 23rd international conference on distributed computing systems, vol 64, no 6, pp 708–724 (2004)
5. Gray JN, Lorie RA, Putzolu GR, Traiger IL (1988) Granularity of locks and degrees of consistency in a shared database. In: Stonebraker M (ed) Readings in database systems. Morgan Kaufmann, San Francisco, CA, pp 94–121
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献