Alternatives and similar repositories for nbds

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

• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆45Updated 7 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆48Updated 12 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• santazhang / simple-rpc
  Simple RPC in C++, with Python binding
  ☆27Updated 10 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 12 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last month
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆164Updated 11 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆54Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• PublicScan / TinyC
  A just-in-time compiler for c minus
  ☆46Updated 12 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆35Updated 2 years ago
• osadalakmal / cpp-raft
  Raft Consensus Algorithm Implementation in C++ (11)
  ☆25Updated 11 years ago
• mpictor / judy-template
  An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …
  ☆45Updated 10 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆13Updated 11 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆76Updated 4 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 9 years ago