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
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
A transactional flash file system for microcontrollers
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
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)
The five-minute rule twenty years later, and how flash memory changes the rules
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
Proceedings of the 14th international conference on Architectural support for programming languages and operating systems
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
NANDFS: a flexible flash file system for RAM-constrained systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
FlashSim: A Simulator for NAND Flash-Based Solid-State Drives
SIMUL '09 Proceedings of the 2009 First International Conference on Advances in System Simulation
Lazy-Adaptive Tree: an optimized index structure for flash devices
Proceedings of the VLDB Endowment
A nearly optimal construction of flash codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Data & Knowledge Engineering
Cheap and large CAMs for high performance data-intensive networked systems
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
PUD-LRU: An Erase-Efficient Write Buffer Management Algorithm for Flash Memory SSD
MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Leveraging value locality in optimizing NAND flash-based SSDs
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Exploiting memory device wear-out dynamics to improve NAND flash memory system performance
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
SkimpyStash: RAM space skimpy key-value store on flash-based storage
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
SILT: a memory-efficient, high-performance key-value store
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs
MASCOTS '11 Proceedings of the 2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems
FB-tree: a B+-tree for flash-based SSDs
Proceedings of the 15th Symposium on International Database Engineering & Applications
B+-tree index optimization by exploiting internal parallelism of flash-based solid state drives
Proceedings of the VLDB Endowment
FlashTier: a lightweight, consistent and durable storage cache
Proceedings of the 7th ACM european conference on Computer Systems
A hybrid SSD with PRAM and NAND Flash memory
Microprocessors & Microsystems
Foundations and Trends in Databases
De-indirection for flash-based SSDs with nameless writes
FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies
IEEE Transactions on Information Theory
Generalized 'write-once' memories
IEEE Transactions on Information Theory
Linear binary code for write-once memories (Corresp.)
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A space-efficient flash translation layer for CompactFlash systems
IEEE Transactions on Consumer Electronics
| Hi-index | 0.00 |
Flash-based Solid State Disks (SSDs) have been a great success story over the last years and are widely used in embedded systems, servers, and laptops. One often overlooked ability of NAND flash is that flash pages can be overwritten in certain circumstances. This can be used to decrease wear out and increase performance. In this paper, we analyze the potential of overwrites for the most used data structure in database applications: the B-Tree. We show that with overwrites it is possible to significantly reduce flash wear out and increase overall performance.