The design and implementation of a log-structured file system
ACM Transactions on Computer Systems (TOCS)
B-trees with inserts and deletes: why free-at-empty is better than merge-at-half
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The log-structured merge-tree (LSM-tree)
Acta Informatica
CFLRU: a replacement algorithm for flash memory
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
Design of flash-based DBMS: an in-page logging approach
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Queue - Enterprise Flash Storage
A sequential indexing scheme for flash-based embedded systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
The five-minute rule 20 years later (and how flash memory changes the rules)
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
CFDC: a flash-aware replacement policy for database buffer management
Proceedings of the Fifth International Workshop on Data Management on New Hardware
Evaluating Non-In-Place Update Techniques for Flash-Based Transaction Processing Systems
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Modern Operating Systems: Jumpstart Sampling Edition
Modern Operating Systems: Jumpstart Sampling Edition
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
Tree indexing on solid state drives
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
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 |
Due to their many advantages, flash-based SSDs (Solid-State Drives) have become a mainstream alternative to magnetic disks for database servers. Nevertheless, database systems, designed and optimized for magnetic disks, still do not fully exploit all the benefits of the new technology. We propose the FB-tree: a combination of an adapted B+-tree, a storage manager, and a buffer manager, all optimized for modern SSDs. Together the techniques enable writing to SSDs in relatively large blocks, thus achieving greater overall throughput. This is achieved by the out-of-place writing, whereby every time a modified index node is written, it is written to a new address, clustered with some other nodes that are written together. While this constantly frees index nodes, the FB-tree does not introduce any garbage-collection overhead, instead relying on naturally occurring free-space segments of sufficient size. As a consequence, the FB-tree outperforms a regular B+-tree in all scenarios tested. For instance, the throughput of a random workload of 75% updates increases by a factor of three using only two times the space of the B+-tree.