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
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆101Updated 2 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆51Updated 8 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 6 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 6 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 4 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 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)
  ☆82Updated 3 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆115Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• efficient / memc3
  MemC3
  ☆156Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆25Updated last year
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 11 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• hyc / BerkeleyDB
  Unofficial repo of historical Oracle BerkeleyDB source
  ☆47Updated 10 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 4 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated this week