Alternatives and similar repositories for database:

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

• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 9 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆69Updated 10 years ago
• kayaklee / libhalog
  Libhalog is an open-source high available redo-log library using multiple paxos.
  ☆37Updated 6 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆17Updated 2 weeks ago
• google / berrydb
  ☆66Updated 4 years ago
• siathalysedI / lsmtree
  Log-Structured Merge-Tree (LSM-Tree)
  ☆89Updated 8 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆27Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆119Updated 5 years ago
• tikv / client-c
  The C++ TiKV client used by TiFlash.
  ☆40Updated 2 months ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆62Updated 3 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆94Updated 5 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• kedebug / yodb
  A lightweight and fast key-value storage engine based on the buffer tree.
  ☆53Updated 11 years ago
• weicao / cascadb
  Yet another write-optimized storage engine, using buffered B-tree algorithm inspired by TokuDB
  ☆426Updated 11 years ago
• doublequan / CStore-Lockfree-SIMD-Skiplist
  ☆12Updated 7 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆99Updated 2 years ago
• yuyuyu101 / C-Buffered-tree
  A buffered-tree implemented in dictionary type and more
  ☆75Updated 11 years ago
• dengoswei / d-raft
  ☆16Updated 7 years ago
• logcabin / liblogcabin
  An attempt to split the Raft library out of LogCabin
  ☆37Updated 7 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆156Updated last year
• greensky00 / skiplist
  Generic lock-free Skiplist container pure C implementation, STL-style set, map
  ☆147Updated 5 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago