Cache Craftiness for Fast Multicore Key-Value Storage

The authors present Masstree, a fast key-value database designed for SMP machines. Masstree keeps all data in memory. Its main data structure is a trie-like concatenation of B+-trees, each of which handles a fixed-length slice of a variable-length key. This structure effectively handles arbitrary-length possibly-binary keys, including keys with long shared prefixes. B+- tree fan-out was chosen to minimize total DRAM delay when descending the tree and prefetching each tree node. Lookups use optimistic concurrency control, a read-copy-update-like technique, and do not write shared data structures; updates lock only affected nodes.

Provided by: Association for Computing Machinery Topic: Storage Date Added: Apr 2012 Format: PDF

Find By Topic