An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
- Title
- An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
- Author
- 이동호
- Keywords
- Flash Memory; BFTL; Index; B-Tree; Buffer Management Scheme
- Issue Date
- 2007-05
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- International Conference on Embedded Software and Systems, ICESS 2007: Embedded Software and Systems, Page. 181-192
- Abstract
- Recently, NAND flash memory has been used for a storage device in
various mobile computing devices such as MP3 players, mobile phones and
laptops because of its shock-resistant, low-power consumption, and nonevolatile
properties, However, due to the very distinct characteristics of flash
memory, disk based systems and applications may result in severe performance
degradation when directly adopting them on flash memory storage systems.
Especially, when a B-tree is constructed, intensive overwrite operations may be
caused by record inserting, deleting, and its reorganizing, This could result in
severe performance degradation on NAND flash memory because of its distinct
characteristics. In this paper, we propose an efficient buffer management
scheme, called IBSF, which eliminates redundant index units in the index buffer
and then delays the time that the index buffer is filled up. Consequently, IBSF
significantly reduces the number of write operations to a flash memory when
constructing a B-tree. We also show that IBSF yields a better performance on a
flash memory by comparing it to the related technique called BFTL through
various experiments.
- URI
- https://link.springer.com/chapter/10.1007/978-3-540-72685-2_18https://repository.hanyang.ac.kr/handle/20.500.11754/106500
- ISBN
- 978-3-540-72684-5
- DOI
- 10.1007/978-3-540-72685-2_18
- Appears in Collections:
- COLLEGE OF COMPUTING[E](소프트웨어융합대학) > COMPUTER SCIENCE(소프트웨어학부) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML