FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
A log buffer-based flash translation layer using fully-associative sector translation
ACM Transactions on Embedded Computing Systems (TECS)
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
STAFF: A flash driver algorithm minimizing block erasures
Journal of Systems Architecture: the EUROMICRO Journal
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A survey of Flash Translation Layer
Journal of Systems Architecture: the EUROMICRO Journal
A B-Tree index extension to enhance response time and the life cycle of flash memory
Information Sciences: an International Journal
Lazy-Update B+-Tree for Flash Devices
MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
Dynamic in-page logging for flash-aware B-tree index
Proceedings of the 18th ACM conference on Information and knowledge management
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Data & Knowledge Engineering
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
A group round robin based b-tree index storage scheme for flash memory devices
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
Solid State Drive (SSD) is rapidly deployed as data storage for embedded and tablet computers due to its shock resistance, fast access, and low power consumption. However, it has some intractable characteristics such as erase-before-write, asymmetric read/write/erase speed, and limited number of write/erase cycles. Due to these hardware characteristics, the hard disk drive (HDD)-based systems and applications could hardly make full use of the advantages of SSD when directly adopting themselves on it. In addition, the frequent changes of B-tree can degrade the performance of SSD and reduce the service life. Most previous works have been battling these thorny problems and improved the performance to some extent. In this paper, we first analyze two existing mechanisms which are suitable to write-intensive and read-intensive workloads, respectively. And we pointed out the drawbacks of them. As a solution, we propose a novel B-tree index implementation scheme, a FlashB-tree, which eliminates the number of reorganizing of the tree structure. And we adopt Online Transition Algorithm for utilizing the superiority of two representative mechanisms. With several indexing profiles having different mixture of insert, select and delete operations of indices, we measured the access time performance, it is sure that the proposed methodology could significantly enhance the efficiency of using index on SSDs.