Alternatives and similar repositories for moderndbs:

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

• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆46Updated 9 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆74Updated 3 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 4 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 11 years ago
• Mytherin / RembranDB
  Sample database with LLVM execution engine.
  ☆11Updated 8 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• chestnutme / kv-store-survey
  survey and analysis of kv-stores in academia and industry
  ☆9Updated 5 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• penberg / sphinx
  Sphinx is a fast in-memory key-value store, compatible with Memcached.
  ☆32Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆41Updated 8 years ago
• codepr / triedb
  Key-value store based on a trie data structure to handle the keyspace.
  ☆12Updated 5 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago
• PumpkinDB / rust-spdk
  Rust bindings for SPDK
  ☆19Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• xelabs / ft-index
  TokuFT is a high-performance, transactional key-value store
  ☆19Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• liuzix / ticompile
  Explore JIT in TiDB
  ☆28Updated 3 years ago
• kumpera / Lock-free-hastable
  An implementation of Split-Ordered List Extensible Hashtable in C
  ☆40Updated 13 years ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆68Updated 8 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆54Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 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)
  ☆74Updated 2 years ago