Dynamic in-page logging for flash-aware B-tree index

This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) scheme in order to address a few new problems that are caused by the unique characteristics of B+ -tree indexes. The d-IPL B+ -tree avoids the frequent log overflow problem by allocating a log area in a flash block dynamically. It also addresses elegantly the problem of page evaporation, imposed by the contemporary NAND flash chips, by introducing ghost nodes within the context of the dynamic IPL scheme. This simple but elegant design of the d-IPL B+ tree improves the performance significantly. For a random insertion workload, the d-IPL B+ -tree index outperformed a B+ -tree with a plain IPL scheme by more than a factor of two in terms of page write and block erase operations. Categories and Subject Descriptors: H.2.4 [Database Management]: System General Terms: Design, Performance, Experimentation

• Type: Conference
• Year: 2009
• Where: CIKM
• Authors: Gap-Joo Na, Sang-Won Lee, Bongki Moon
• Keywords: B+ -tree Index, CIKM 2009, D-ipl B+, Database, Dynamic IPL B+