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
  ☆117Updated 10 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• santazhang / simple-rpc
  Simple RPC in C++, with Python binding
  ☆27Updated 10 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆62Updated 6 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆121Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 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
• eapache / wof_alloc
  Fast C/C++ memory allocator with free-all operation
  ☆55Updated 10 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated last month
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 9 years ago
• jamwt / rolla
  Rolla - Tiny, fast, crash-safe embedded k/v storage engine
  ☆53Updated 2 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• armon / c-minheap-array
  Implements a Min-Heap / Priority Queue in C using a simple array.
  ☆57Updated 4 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 8 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆162Updated 10 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• berenm / bplus-tree
  Fast in-memory B+-Tree implementation in C.
  ☆29Updated 9 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 11 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆13Updated 10 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆140Updated 5 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago