Concurrency control and recovery for balanced B-link trees

Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so that a logarithmic time bound for a search or an update operation is guaranteed under arbitrary sequences of record insertions and deletions. A database transaction can contain any number of operations of the form "fetch the first (or next) matching record", "insert a record", or "delete a record", where database records are identified by their primary keys. Repeatable-readlevel isolation for transactions is guaranteed by key-range locking. The algorithms apply the write-ahead logging (WAL) protocol and the steal and no-force buffering policies for index and data pages. Record inserts and deletes on leaf pages of a B-link tree are logged using physiological redo-undo log records. Each structure modification such as a page split or merge is made an atomic action by keeping the pag...

• Type: Conference
• Year: 2005
• Where: VLDB
• Authors: Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
• Keywords: Balanced Blink Tree, Database, Redo-only Log Record, Structure Modification, VLDB 2005