Write-optimized B-trees Export

@inproceedings{citeulike:4822773, abstract = {Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports both in-place updates and large append-only ("log-structured") write operations within the same storage volume, within the same B-tree, and even at the same time. The essence of the proposal is to make page migration inexpensive, to migrate pages while writing them, and to make such migration optional rather than mandatory as in log-structured file systems. The inexpensive page migration also aids traditional defragmentation as well as consolidation of free space needed for future large writes. These advantages are achieved with a very limited modification to conventional B-trees that also simplifies other B-tree operations, e.g., key range locking and compression.}, author = {Graefe, Goetz}, booktitle = {VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases}, citeulike-article-id = {4822773}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1316689.1316748}, isbn = {0-12-088469-0}, keywords = {2004, b-tree, btree, vldb, write-optimized}, location = {Toronto, Canada}, pages = {672--683}, posted-at = {2009-06-12 12:07:06}, priority = {2}, publisher = {VLDB Endowment}, title = {Write-optimized B-trees}, url = {http://portal.acm.org/citation.cfm?id=1316689.1316748}, year = {2004} }

TY - CONF ID - citeulike:4822773 L3 - citeulike-article-id:4822773 N2 - Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports both in-place updates and large append-only ("log-structured") write operations within the same storage volume, within the same B-tree, and even at the same time. The essence of the proposal is to make page migration inexpensive, to migrate pages while writing them, and to make such migration optional rather than mandatory as in log-structured file systems. The inexpensive page migration also aids traditional defragmentation as well as consolidation of free space needed for future large writes. These advantages are achieved with a very limited modification to conventional B-trees that also simplifies other B-tree operations, e.g., key range locking and compression. CY - Toronto, Canada SN - 0-12-088469-0 EP - 683 TI - Write-optimized B-trees PB - VLDB Endowment T2 - VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases SP - 672 KW - 2004 KW - b-tree KW - btree KW - vldb KW - write-optimized AU - Graefe, Goetz PY - 2004/// UR - http://portal.acm.org/citation.cfm?id=1316689.1316748 ER -