Alternatives and similar repositories for mapkeeper

Users that are interested in mapkeeper are comparing it to the libraries listed below

• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆25Updated 10 months ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆81Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆103Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆163Updated last year
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 7 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• memKeyDB / memKeyDB
  MemKeyDB is a fork of Redis, adjusted to store objects on both Intel Optane Persistent Memory and DRAM.
  ☆77Updated last year
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• urcs-sync / ralloc
  Recoverable lock-free allocator based on LRMalloc
  ☆47Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆155Updated 7 years ago
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated last month
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 2 months ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• BU-DiSC / lethe-codebase
  ☆14Updated 3 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆114Updated 3 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago