DocumentCode
2452297
Title
Concurrent and Recoverable Restructuring Method for Database Indices
Author
Jaluta, Ibrahim ; Fekihal, M. Abusaa
Author_Institution
Dept. of Comput. Sci. & Eng., Helsinki Univ. of Technol.
Volume
2
fYear
0
fDate
0-0 0
Firstpage
2913
Lastpage
2917
Abstract
In this paper, we present a top-down restructuring method for Bplusmntrees in which a structure modification such as page split or merge is executed as an atomic action. Each structure modification is logged using a single redo-only log record. The execution of each structure modification involves X-latching three pages at most on two adjacent levels of the Bplusmntree for short duration. A Bplusmntree structure modification, once executed to completion can never be undone no matter if the transaction that triggered such a structure modification commits or aborts later on. Recoverability of the Bplusmntree structure is guaranteed because the redo pass of our ARIES-based recovery protocol produces a structurally consistent tree. The method improves concurrency, simplifies recovery, reduces the amount of logging, and can be used in systems that use redo-only or redo-undo recovery protocols
Keywords
concurrency control; database indexing; protocols; tree data structures; ARIES recovery protocol; Bplusmntree; X-latching; concurrent restructuring; database index; recoverable restructuring; redo-only log record; redo-only recovery protocol; redo-undo recovery protocol; structure modification; top-down restructuring; Concurrent computing; Data engineering; Databases; Protocols; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communication Technologies, 2006. ICTTA '06. 2nd
Conference_Location
Damascus
Print_ISBN
0-7803-9521-2
Type
conf
DOI
10.1109/ICTTA.2006.1684876
Filename
1684876
Link To Document