Efficient space management for b-tree structure-modification operations

Proceedings - 2006 International Conference on Information and Communication Technologies: From Theory to Applications, ICTTA 2006

Volumn 2, Issue , 2006, Pages 2909-2912

  Jaluta, Ibrahim ^a   Majumda, Dibyendu ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

B TREES; GARBAGE COLLECTION; PAGE ALLOCATION; SPACE MANAGEMENT; TREE STRUCTURES;

TREES (MATHEMATICS);

EID: 84866509054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTTA.2006.1684875     Document Type: Conference Paper

References (7)

1. Gray, J., Reuter, A. Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993.
2. Jaluta, I., Sippu, S., and Soisalon-Soininen, E. 2005. Concurrency control and recovery for balanced B-link trees. The VLDB Journal 14, pages 257-277.
3. Lomet, D. "Advanced recovery techniques in practice", Recovery Mechanisms in Database Systems (V. Kumar and M. Hsu, eds.), Prentice Hall PTR, 1998, pages 697-710.
4. Lomet, D., Salzberg, B. "Concurrency and recovery for index trees", The VLDB Journal 6 (1997), pages 224-240.
5. Mohan, C. "Concurrency control and recovery methods for B+tree indexes: ARIES/KVL and ARIES/IM", Performance of Concurrency Control Mechanisms in Centralized Database Systems (V.Kumar, ed.), Prentice Hall, 1996, pages 248-306.
6. Mohan, C. "ARIES/KVL: A key-value locking method for concurrency control of multi-action transactions operation on B-tree indexes", Proc. ofthe 16th VLDB Conference, 1990, pages 392-405.
7. Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., Schwarz, P. "ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging", ACM Trans. Database Systems 17 (1992), pages 94-162.