Show simple item record

dc.contributor.authorAmur, Hrishikesh
dc.contributor.authorAndersen, David G.
dc.contributor.authorKaminsky, Michael
dc.contributor.authorSchwan, Karsten
dc.date.accessioned2015-06-09T16:03:21Z
dc.date.available2015-06-09T16:03:21Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/1853/53627
dc.description.abstractThe WriteBuffer (WB) Tree is a new write-optimized data structure that can be used to implement per-node storage in unordered key-value stores. TheWB Tree provides faster writes than the Log-Structured Merge (LSM) Tree that is used in many current high-performance key-value stores. It achieves this by replacing compactions in LSM Trees, which are I/O-intensive, with light-weight spills and splits, along with other techniques. By providing nearly 30 higher write performance compared to current high-performance key-value stores, while providing comparable read performance (1-2 I/Os per read using 1-2B per key of memory), the WB Tree addresses the needs of a class of increasingly popular write-intensive workloads.en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.relation.ispartofseriesCERCS ; GIT-CERCS-13-08en_US
dc.subjectI/O-intensiveen_US
dc.subjectKey-value storesen_US
dc.subjectPer-node storageen_US
dc.subjectRead performanceen_US
dc.subjectWrite performanceen_US
dc.titleDesign of a Write-Optimized Data Storeen_US
dc.typeTechnical Reporten_US
dc.contributor.corporatenameGeorgia Institute of Technology. Center for Experimental Research in Computer Systemsen_US
dc.contributor.corporatenameGeorgia Institute of Technology. College of Computingen_US
dc.contributor.corporatenameCarnegie-Mellon Universityen_US
dc.contributor.corporatenameIntel Corporationen_US
dc.embargo.termsnullen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record