https://scholars.lib.ntu.edu.tw/handle/123456789/118012
標題: | An Efficient B-Tree Layer Implementation for Flash-Memory Storage Systems | 作者: | Wu, Chin-Hsien TEI-WEI KUO Chang, Li Ping |
關鍵字: | Algorithm; B-tree; database systems; Design; embedded systems; Flash memory; Performance; storage systems | 公開日期: | 2007 | 卷: | 6 | 期: | 3 | 起(迄)頁: | 19 | 來源出版物: | ACM Transactions on Embedded Computing Systems | 摘要: | With the significant growth of the markets for consumer electronics and various embedded systems, flash memory is now an economic solution for storage systems design. Because index structures require intensively fine-grained updates/modifications, block-oriented access over flash memory could introduce a significant number of redundant writes. This might not only severely degrade the overall performance, but also damage the reliability of flash memory. In this paper, we propose a very different approach, which can efficiently handle fine-grained updates/modifications caused by B-tree index access over flash memory. The implementation is done directly over the flash translation layer (FTL); hence, no modifications to existing application systems are needed. We demonstrate that when index structures are adopted over flash memory, the proposed methodology can significantly improve the system performance and, at the same time, reduce both the overhead of flash-memory management and the energy dissipation. The average response time of record insertions and deletions was also significantly reduced. © 2007, ACM. All rights reserved. |
URI: | http://ntur.lib.ntu.edu.tw//handle/246246/154679 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021210434&doi=10.1145%2f1275986.1275991&partnerID=40&md5=b988a94479303ef5bd191fbb025bc001 |
ISSN: | 15399087 | DOI: | 10.1145/1275986.1275991 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。