Title:
Design of a Write-Optimized Data Store
Design of a Write-Optimized Data Store
Authors
Amur, Hrishikesh
Andersen, David G.
Kaminsky, Michael
Schwan, Karsten
Andersen, David G.
Kaminsky, Michael
Schwan, Karsten
Authors
Person
Advisors
Advisors
Associated Organizations
Organizational Unit
Series
Collections
Supplementary to
Permanent Link
Abstract
The 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.
Sponsor
Date Issued
2013
Extent
Resource Type
Text
Resource Subtype
Technical Report