A Concurrency Buffer Control in B-Trees for Flash-Memory Storage Systems

摘要

Huge-capacity flash-memory is now an economic solution for various portable devices and embedded systems, a NAND flash-based storage system has replaced a hard-disk drive in many applications. Recently, the implementation of database systems on NAND flash-based storage systems has become an important research topic. In particular, the B-tree index is an important data structure on database systems. With the very distinctive characteristics of flash-memory, previous work focuses on the manipulation of the B-tree index structures but the concurrency buffer control problem in flash-memory storage systems is not addressed. In the paper, we will propose a concurrency buffer control to increase the system throughput when two or more processes could access the same B-tree index structure.