Alternatives and similar repositories for mapkeeper

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

• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 2 weeks ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 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
• aronszanto / sLSM-Tree
  High-Performance C++ Data System
  ☆131Updated 4 months ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 6 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 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)
  ☆83Updated 3 years ago
• w32zhong / BTreeimplementation
  CSC 541 Assignment 4 B-Trees Introduction The goals of this assignment are two-fold: To introduce you to searching data on disk using B…
  ☆11Updated 10 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 7 years ago
• CatKang / Solitaire
  Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model
  ☆18Updated 7 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 3 years ago
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆110Updated 2 years ago
• mtyiu / memec
  MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store
  ☆11Updated 8 years ago
• BU-DiSC / lethe-codebase
  ☆15Updated 4 years ago
• tengdj / lsbm
  lsm-tree with buffered merge
  ☆12Updated 3 years ago
• epfl-labos / TRIAD
  ☆44Updated 4 years ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆26Updated last year
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆71Updated 11 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆96Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago