Optimistic concurrency control by melding trees

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 944-955

  Bernstein, Philip A ^a   Reid, Colin W ^a   Wu, Ming ^a   Yuan, Xinhao ^b  

^a MICROSOFT   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; FORESTRY;

CONCURRENCY CONTROL ALGORITHMS; CRITICAL PATHS; MULTI-VERSION; OPTIMISTIC CONCURRENCY CONTROLS; TRANSACTION EXECUTION; TRANSACTION SYSTEMS; TREE-STRUCTURED DATA; UPDATE TRANSACTION;

TREES (MATHEMATICS);

ALGORITHMS; DATA BASES; DATA PROCESSING;

EID: 84863752536     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402732     Document Type: Conference Paper

References (20)

1. Adya, A., R. Gruber, B. Liskov, and U. Maheshwari: Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks. SIGMOD 1995, pp. 23-34, 1995.
2. Agrawal, D., A. J. Bernstein, P. Gupta, and S. Sengupta: Distributed Multi-version Optimistic Concurrency Control with Reduced Rollback. Distributed Computing, 2(1):45-59, 1987.
3. Aguilera, M.K., W.M. Golab, and M.A. Shah: A Practical Scalable Distributed B-tree. PVLDB 1(1): 598-609, 2008.
4. Bernstein, P.A., C.W. Reid, and S. Das: Hyder-A Transactional Record Manager for Shared Flash. CIDR 2011, pp. 9-20, 2011.
5. Elnikety, S., S. Dropsho, and F. Pedone. Tashkent: Uniting Durability with Transaction Ordering for High-Performance Scalable Database Replication. Proc. of EuroSys 2006, pp. 117-130, 2006.
6. Fredkin, E.: Trie memory. CACM, 3(9):490-499, 1960.
7. Gazagnairem, T. and V. Hanquez: OXenstored-An Efficient Hierarchical and Transactional Database using Functional Programming with Reference Cell Comparisons. Int'l. Conf. on Functional Prog. (ICFP 2009), pp. 203-214, 2009.
8. Graefe, G: Write-optimized B-trees. VLDB 2004, pp. 672-683, 2004.
9. Gray, J.N, and A. Reuter: Transaction Processing: Concepts and Techniques. Morgan-Kauffman. 1992.
10. Gruber, R.E.: Optimistic Concurrency Control for Nested Distributed Transactions. Tech. Report MIT/LCS/TR-453, MIT, June 1989.
11. Haustein, H.P., T. Härder, K. Luttenberger: Contest of XML Lock Protocols. VLDB 2006, pp. 1069-1080, 2006.
12. Kung, H. T. and J.T. Robinson: On Optimistic Methods for Concurrency Control. ACM TODS 6(2): 213-226, 1981.
13. Lausen, G. Concurrency Control in Database Systems: A Step towards the Integration of Optimistic Methods and Locking. Proc. ACM Annual Conf. 1982, pp. 64-68, 1982.
14. Lee, S-W. and B. Moon. Design of Flash-based DBMS: an In-page Logging Approach. SIGMOD 2007, pp. 55-66, 1982.
15. O'Neil, P., E. Cheng, D. Gawlick, E. O'Neil: The Log-Structured merge-tree (LSM-tree). Acta Inf. 33(4): 351-385, 1996.
16. Phatak, S.H. and B. R. Badrinath: Bounded locking for optimistic concurrency control. Rutgers University TR DCS-TR-380, 1999.
17. Seltzer, M.I. Transaction Support in a Log-Structured File System. ICDE 1993, pp. 503-510, 1993.
18. Sheth A. P. and M. T. Liu: Integrating Locking and Optimistic Concurrency Control in Distributed Database Systems. ICDCS 1986, pp. 89-99, 1986.
19. Thomasian, A. and E. Rahm: A New Distributed Optimistic Concurrency Control Method and a Comparison of its Performance with Two-Phase Locking. ICDCS 1990, pp. 294-301, 1990.
20. Wu, C-H. L-P. Chang, T-W. Kuo: An Efficient R-tree Implementation over Flash-memory Storage Systems. ACM GIS 2003, pp. 17-24, 2003.