A survey of B-tree locking techniques

ACM Transactions on Database Systems

Volumn 35, Issue 3, 2010, Pages

  Graefe, Goetz ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Algorithms

Indexed keywords

B TREES; BASIC OPERATION; BASIC STRUCTURE; DATA-BASE MANAGEMENT SYSTEMS; LOCKING TECHNIQUE; STORAGE SYSTEMS;

DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; SURVEYS; TREES (MATHEMATICS);

CONCURRENCY CONTROL;

EID: 77955207233     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1806907.1806908     Document Type: Article

References (31)

1. BAYER, R. 1997. The universal B-Tree for multidimensional indexing: General concepts. In Proceedings of the International Conference on Worldwide Computing and Its Applications (WWCA'97). 198-209
2. BAYER, B. AND MCCREIGHT, E. M. 1972. Organization and maintenance of large ordered indices Acta Inform. 1, 173-189
3. BAYER, R. AND SCHKOLNICK, M. 1977. Concurrency of operations on B-trees. Acta Inform. 9, 1-21
4. BAYER, R., UNTERAUER, K. 1977. Prefix B-trees. ACM Trans. Datab. Syst. 2, 1, 11-26
5. BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison-Wesley
6. COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-137
7. ESWARAN, K. P., GRAY, J., LORIE, R. A., AND TRAIGER, I. L. 1976. The notions of consistency and predicate locks in a database system. Comm. ACM 19, 11, 624-633
8. GAWLICK, D. AND KINKADE, D. 1985. Varieties of concurrency control in IMS/VS fast path. IEEE Datab. Engin. Bull. 8, 2, 3-10
9. GRAEFE, G. 2007. Hierarchical locking in B-tree indexes. In Proceedings of the BTW Conference 18-42
10. GRAEFE, G. AND ZWILLING, M. J. 2004. Transaction support for indexed views. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 323-334
11. GRAY, J. AND REUTER, A. 1993. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Fransisco, CA
12. JALUTA, I., SIPPU, S., AND SOISALON-SOININEN, E. 2005. Concurrency control and recovery for balanced B-link trees. VLDB J. 14, 2, 257-277
13. JORDAN, J. R., BANERJEE, J., AND BATMAN, R. B. 1981. Precision locks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 143-147
14. KORTH, H. F. 1983. Locking primitives in a database system. J. ACM 30, 1, 55-79
15. KUNG, H. T. AND ROBINSON, J. T. 1981. On optimistic methods for concurrency control. ACM Trans Datab. Syst. 6, 2, 213-226
16. LARUS, J. R. AND RAJWAR, R. 2006. Transactional Memory. Synthesis Lectures on Computer Architecture. Morgan and Claypool Publishers
17. LEHMAN, P. L. AND YAO, S. B. 1981. Efficient locking for concurrent operations on B-trees. ACM Trans. Datab. Syst. 6, 4, 650-670
18. LOMET, D. B. 1993. Key range locking strategies for improved concurrency. In Proceedings of the International Conference on Very Large Databases (VLDB'93). 655-664
19. LOMET, D. B. 2004. Simple, robust and highly concurrent B-trees with node deletion. In Proceedings of the International Conference on Data Engineering (ICDE'04). 18-28
20. LUO, G.,NAUGHTON, J. F.,ELLMANN, C. J., ANDWATZKE, M. 2005. Locking protocols for materialized aggregate join views. IEEE Trans. Knowl. Data Engin. 17, 6, 796-807
21. MOHAN, C. 1990. ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. In Proceedings of the International Conference on Very Large Databases (VLDB'90). 392-405
22. MOHAN, C. AND LEVINE, F. 1992. ARIES/IM: An efficient and high concurrency index management method using write-ahead logging. In Proceedings of the ACMSIGMOD International Conference on Management of Data. 371-380
23. MOSS, J. E. B. 2006. Open nested transactions: Semantics and support. In Proceedings of the Workshop on Memory Performance Issues (WMPI'06)
24. NI, Y., MENON, V., ADL-TABATABAI, A.-R., HOSKING, A. L., HUDSON, R. L., MOSS, J. E. B., SAHA, B., AND SHPEISMAN, T. 2007. Open nesting in software transactional memory. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'07). 68-78.
25. O'NEIL, P. E. 1986. The Escrow transactional method. ACM Trans. Datab. Syst. 11, 4, 405-430
26. RAMSAK, F., MARKL, V., FENK, R., ZIRKEL, M., ELHARDT, K., AND BAYER, R. 2000. Integrating the UB-tree into a database system kernel. In Proceedings of the International Conference on Very Large Databases (VLDB'00). 263-272
27. SRINIVASAN, V. AND CAREY, M. J. 1991. Performance of B-tree concurrency algorithms. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 416-425
28. WEIKUM, G. 1991. Principles and realization strategies of multilevel transaction management ACM Trans. Datab. Syst. 16, 1, 132-180
29. WEIKUM, G. AND SCHEK, H.-J. 1992. Concepts and applications of multilevel transactions and open nested transactions. In Database Transaction Models for Advanced Applications. 515-553
30. WEIKUM, G. AND VOSSEN, G. 2002. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, San Fransisco, CA
31. ZOU, C. AND SALZBERG, B. 1996. On-Line reorganization of sparsely-populated B+-trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 115-124.