Work

Cache craftiness for fast multicore key-value storage

Year: 2012

Type: conference-paper

Abstract: We 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 possiblybinary keys, including keys with long shared prefixes. +-tree fanout 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. Logging and checkpointing provide consistency and durability. Though some of these ideas appear elsewhere, Masstree is the first to combine them. We discuss design variants and their consequences.

Source: European Conference on Computer Systems

DOI: 10.1145/2168836.2168855

Authors: Yandong Mao, Eddie Kohler, Robert Tappan Morris

Institutions: Massachusetts Institute of Technology, Harvard University

Language: English

Topic: Advanced Database Systems and Queries

Subfield: Information Systems

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Microsoft Research

Awards: CSR-PSCE, SM: An Operating System for Multi-core Processors, CSR: Small: CoreTime: Dynamic Computation Migration for Multicore System Software