首页> 外文会议>Proceedings of the EuroSys 2012 conference >Cache Craftiness for Fast Multicore Key-Value Storage
【24h】

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 possibly-binary keys, including keys with long shared prefixes. B~+-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 pro-vide consistency and durability. Though some of these ideas appear elsewhere, Masstree is the first to combine them. We discuss design variants and their consequences. On a 16-core machine, with logging enabled and queries arriving over a network. Masstree executes more than six million simple queries per second. This performance is com-parable to that of memcached, a non-persistent hash table server, and higher (often much higher) than that of VoltDB, MongoDB, and Redis.
机译:我们介绍Masstree。专为SMP机器设计的快速键值数据库。 Masstree将所有数据保留在内存中。它的主要数据结构是B〜+-树的特里耶式串联,每个B-+-树处理可变长度密钥的固定长度切片。该结构有效地处理了任意长度的可能二进制密钥,包括具有长共享前缀的密钥。选择B〜+树扇出可以最大程度地降低下降树和预取每个树节点时的总DRAM延迟。查找使用开放式并发控制,这是一种类似于读取-复制-更新的技术,并且不编写共享数据结构:更新仅锁定受影响的节点。日志记录和检查点提供了一致性和持久性。尽管其中一些想法出现在其他地方,但Masstree是第一个将它们结合起来的。我们讨论设计变型及其后果。在启用了日志记录并通过网络到达查询的16核计算机上。 Masstree每秒执行超过600万个简单查询。这种性能与非持久性哈希表服务器memcached相比,并且比VoltDB,MongoDB和Redis更高(通常更高)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号