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

被引：3

作者：

Wu, Chin-Hsien ^{[1
]}

Lin, Yu-Hsun ^{[1
]}

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Elect Engn, Taipei, Taiwan

来源：

IEEE EMBEDDED SYSTEMS LETTERS | 2012年 / 4卷 / 01期

关键词：

Concurrency control; database systems; flash-memory; storage systems; index structures;

D O I：

10.1109/LES.2012.2188271

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：9 / 12

页数：4

共 8 条

[1]

Kang D., 2007, P 7 ACM IEEE INT C E

[2] A new measure of motion picture distortion and its applications to picture quality improvement on AC PDP [J].

Kim, JW ;

Kim, YD ;

Kang, SH ;

Kim, DW ;

Hong, KS .

IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2002, 48 (02) :275-283

[3]

Lee H. S., 2007, P INT C EMB SOFTW SY

[4]

NAND, 2011, NAND FLASH MEMORY DA

[5]

NATH S, 2007, P 6 INT C INF PROC S

[6] An efficient B-tree layer implementation for flash-memory storage systems [J].

Wu, Chin-Hsien ;

Kuo, Tei-Wei ;

Chang, Li Ping .

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2007, 6 (03) :19

[7]

Xiang X., 2008, P ACM S APPL COMP CE

[8]

Zeinalipour-Yazti D., 2005, P USENIX C FIL STOR

← 1 →