Alternatives and similar repositories for ribs2

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

• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆78Updated 3 years ago
• fredrikwidlund / libdynamic
  High performance utility library for C
  ☆94Updated 3 months ago
• skaphan / stmmap
  STM (Software Transactional Memory) implementation in C, based on memory-mapping.
  ☆60Updated 15 years ago
• baruch / libwire
  User space threading (aka coroutines) library for C resembling GoLang and goroutines
  ☆167Updated 7 years ago
• Lupus / libevfibers
  Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.
  ☆139Updated 6 years ago
• agl / critbit
  Critbit trees in C
  ☆334Updated 3 years ago
• ademakov / MainMemory
  Wannabe Main Memory Database and More
  ☆54Updated 4 years ago
• aji / libco
  userspace threads and coroutines for C
  ☆18Updated 10 years ago
• stevedekorte / coroutine
  C multiplatform coroutine implementation via ucontext, fibers or setjmp
  ☆264Updated 16 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• dankamongmen / libtorque
  A threaded, continuations-based I/O event library for manycore NUMA machines
  ☆73Updated 4 years ago
• sustrik / dsock
  An obsolete project
  ☆83Updated 7 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated 2 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• clibs / coro
  Coroutines in C
  ☆121Updated 11 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 5 months ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆183Updated last year
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆108Updated 8 years ago
• LMDB / sqlightning
  SQLite3 ported to use LMDB instead of its original Btree code. See https://github.com/LumoSQL/LumoSQL for maintained fork.
  ☆316Updated 5 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• stevedekorte / skipdb
  C based ordered key-value ACID DB using a skip list data structure
  ☆163Updated 10 years ago
• amadvance / tommyds
  A C library of hashtables and tries designed to store objects with high performance
  ☆238Updated 2 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• srned / Prez
  Prez is a distributed system based on Raft algorithm that provides highly reliable, consistent store.
  ☆55Updated 10 years ago
• chriso / intern
  Fast, efficient string interning
  ☆96Updated 7 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago
• fbuihuu / libtree
  A library which implements a couple of famous binary search trees.
  ☆165Updated 3 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• jmckaskill / c-capnproto
  C library/compiler for the Cap'n Proto serialization/RPC protocol
  ☆69Updated 2 years ago