Alternatives and similar repositories for btree:

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

• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆74Updated 3 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆117Updated 5 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 12 years ago
• logcabin / liblogcabin
  An attempt to split the Raft library out of LogCabin
  ☆38Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆99Updated 6 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆52Updated 10 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• baruch / libwire
  User space threading (aka coroutines) library for C resembling GoLang and goroutines
  ☆166Updated 6 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆246Updated 4 years ago
• couchbaselabs / ForestDB-Benchmark
  Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger
  ☆34Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 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
• andy-yx-chen / cornerstone
  A C++ Raft implementation, project moved
  ☆24Updated 8 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆161Updated 10 years ago
• dengoswei / d-raft
  ☆16Updated 7 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 3 years ago
• pmwkaa / ioarena
  Embedded storage benchmarking tool
  ☆137Updated 2 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• BohuTANG / omt
  A cache-efficiency weight balanced binary tree
  ☆70Updated 10 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• tnm / libpaxos2
  A Paxos implementation in C originally by Marco Primi, built on top of libevent
  ☆35Updated 13 years ago
• willemt / ticketd
  A distributed durable unique 64bit ID server
  ☆200Updated 6 years ago
• j0sh / radixtree
  The finest radix tree this side of the Linux kernel.
  ☆34Updated 9 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 6 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 2 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆140Updated 5 years ago