Paper Info
Title
A Concurrency Buffer Control in B-Trees for Flash-Memory Storage Systems
Abstract
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.
Year
DOI
Venue
2012
10.1109/LES.2012.2188271
Embedded Systems Letters
Keywords
Field
DocType
concurrency control,tree data structures,throughput,data structure,indexes,concurrent computing,embedded systems,process control,embedded system,b trees,database systems,storage system,indexation,database system
Isolation (database systems),Flash memory,Concurrency control,Computer science,Concurrency,Computer data storage,Parallel computing,NAND gate,Real-time computing,Concurrent computing,Distributed concurrency control
Journal
Volume
Issue
ISSN
4
1
1943-0663
Citations 
PageRank 
References 
1
0.35
5
Authors
2
Name
Order
Citations
PageRank
Chin-Hsien Wu141947.93
Yu-Hsun Lin217014.53