Referenced Items are not available for this document.
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.
Published in:
Embedded Systems Letters, IEEE
(Volume:4
,
Issue:
1
)
Date of Publication: March 2012
- Page(s):
- 9 - 12
- ISSN :
- 1943-0663
- INSPEC Accession Number:
- 12615169
- Digital Object Identifier :
- 10.1109/LES.2012.2188271
- Product Type:
- Journals & Magazines
- Date of Publication :
- 16 February 2012
- Date of Current Version :
- 19 March 2012
- Issue Date :
- March 2012
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
