An Improved Approach on B Tree Management for NAND Flash-Memory Storage Systems

With the significant growth of the markets for consumer electronics and various embedded systems, flash memory is now an economic solution for storage systems design. Tree index structures have been adopted over flash-memory and the system performance can be significantly improved. But with the very distinctive characteristics of flash-memory, the overhead of intensive byte-wise operations are caused by record inserting, record deleting, and tree reorganizing. Such actions result in a large number of data copyings (i.e., the copying of unchanged data and tree pointers in related nodes). In this paper, we introduced segment, segment summary and segment mapping, and they can reduce the possibility of related node update problem and improve the system performance.