Alternatives and similar repositories for b-tree

Users that are interested in b-tree are comparing it to the libraries listed below

• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 7 months ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆28Updated 11 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated 3 weeks ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• Kronuz / cpp-btree
  Modern C++ B-tree containers
  ☆277Updated 2 years ago
• algorithm-ninja / cpp-btree
  Git mirror of the official (mercurial) repository of cpp-btree
  ☆78Updated 11 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• BartMassey / popcount
  popcount algorithms in C and Rust
  ☆30Updated last year
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆38Updated last year
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆135Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• jgarzik / sqlfun
  Modern SQL parser using Bison (Yacc) and Flex
  ☆90Updated 10 months ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• pgoodman / rcu
  C++ implementation of RCU based on reference counting and hazard pointers.
  ☆28Updated 12 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• scotts / michael
  Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
  ☆17Updated 11 years ago
• condy0919 / bipolar
  A nano concurrency library
  ☆24Updated 5 years ago
• embedded2016 / bplus-tree
  B+ tree implementation in C
  ☆132Updated 5 years ago
• memsql / lockfree-bench
  Benchmarks for lockfree datastructures.
  ☆120Updated 11 years ago
• ddeka0 / AsyncIO
  A CPP wrapper for asynchronous socket server using linux's latest IO_URING API
  ☆25Updated 3 years ago
• viktorleis / mmapbench
  ☆143Updated 3 years ago
• thinkpad20 / sql
  A front-end (lexer, parser and partial compiler) for a subset of the SQL language
  ☆45Updated 12 years ago