Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Using write-once memory for database storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
How to reuse a "write - once " memory (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
FlashDB: dynamic self-tuning database for NAND flash
Proceedings of the 6th international conference on Information processing in sensor networks
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)
Query processing techniques for solid state drives
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
FlashLogging: exploiting flash devices for synchronous logging performance
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
An object placement advisor for DB2 using solid state storage
Proceedings of the VLDB Endowment
Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Towards cost-effective storage provisioning for DBMSs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitude increased performance relative to magnetic disks. Flash memory has some unusual characteristics. In particular, general updates require a page write, while updates of 1 bits to 0 bits can be done in-place. In order to measure how well algorithms perform on such a device, we propose the "EWOM" model for analyzing algorithms on flash memory devices. We introduce flash-aware algorithms for counting, listmanagement, and B-trees, and analyze them using the EWOM model. This analysis shows that one can use the incremental 1-to-0 update properties of flash memory in interesting ways to reduce the required number of page-write operations.