Cache craftiness for fast multicore key-value storage
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 poss...
Main Authors: | Mao, Yandong, Kohler, Eddie, Morris, Robert Tappan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2012
|
Online Access: | http://hdl.handle.net/1721.1/72690 https://orcid.org/0000-0003-2700-9286 |
Similar Items
-
Optimizing MapReduce for Multicore Architectures
by: Kaashoek, Frans, et al.
Published: (2010) -
A Software Approach to Unifying Multicore Caches
by: Boyd-Wickizer, Silas, et al.
Published: (2011) -
The scalable commutativity rule: designing scalable software for multicore processors
by: Clements, Austin T., et al.
Published: (2014) -
Reinventing Scheduling for Multicore Systems
by: Boyd-Wickizer, Silas, et al.
Published: (2011) -
Fast in-memory storage systems : two aspects
by: Mao, Yandong
Published: (2015)