Dynamic In-Page Logging for B⁺-tree Index

Unlike database tables, B
⁺
-tree indexes are hierarchical and their structures change over time by node splitting operations, which may propagate changes from one node to another. The node splitting operation is difficult for the basic In-Page Logging (IPL) scheme to deal with, because it involves more than one node that may be stored separately in different flash blocks. In this paper, we propose Dynamic IPL B
⁺
-tree (d-IPL B
⁺
-tree in short) as a variant of the IPL scheme tailored for flash-based B+-tree indexes. The d-IPL B
⁺
-tree addresses the problem of frequent log overflow by allocating a log area in a flash block dynamically. It also avoids a page evaporation problem, imposed by the contemporary NAND flash chips, by introducing ghost nodes to d-IPL B
⁺
-tree. This simple but elegant design of the d-IPL B
⁺
-tree provides significant performance improvement over existing approaches. For a random insertion workload, the d-IPL B
⁺
-tree outperformed a B
⁺
-tree with the plain IPL scheme by more than a factor of two in terms of page write and block erase operations.