Alternatives and similar repositories for nbds

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

• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• santazhang / simple-rpc
  Simple RPC in C++, with Python binding
  ☆27Updated 10 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 12 years ago
• wichtounet / btrees
  C++ implementation of concurrent Binary Search Trees
  ☆72Updated 10 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• rmind / libqsbr
  QSBR and EBR library
  ☆127Updated 5 years ago
• markpapadakis / coros-fibers
  Coroutines/Fibers implementation for x86
  ☆65Updated 9 years ago
• Naruil / SSMalloc
  A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
  ☆68Updated 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
  ☆108Updated 8 years ago
• JGRennison / cpp-btree
  Clone of Google's cpp-btree B-tree set and map containers, with minor fixes/modifications.
  ☆37Updated 3 months ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆33Updated last year
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆55Updated 10 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• cameron314 / microbench
  A lightweight (3 file, single function) library for running micro-benchmarks on C++ code
  ☆83Updated 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
  ☆53Updated last year
• PublicScan / TinyC
  A just-in-time compiler for c minus
  ☆46Updated 12 years ago
• solatis / libpaxos-cpp
  libpaxos-cpp is a C++ implementation of the Paxos distributed consensus protocol
  ☆67Updated 12 years ago
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 4 years ago
• rmind / ttimer
  Tick-based timer (hierarchical timing wheel algorithm)
  ☆44Updated 5 years ago
• r-lyeh-archived / malloc-survey
  Allocation benchmarks
  ☆30Updated 9 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• abique / melon
  M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.
  ☆16Updated 13 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago