Alternatives and similar repositories for libqsbr

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

• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆91Updated last year
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆250Updated 4 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 10 years ago
• LPD-EPFL / ASCYLIB
  ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…
  ☆180Updated 7 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆58Updated 6 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆159Updated 3 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆72Updated last year
• tempesta-tech / blog
  Our open source benchmarks and code samples
  ☆192Updated this week
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 6 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 7 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆79Updated 3 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆161Updated last year
• malbrain / database
  Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency
  ☆75Updated 3 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 5 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated 2 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• cyfdecyf / spinlock
  Different implementations of spinlock.
  ☆105Updated 10 years ago
• ucf-cs / Tervel
  Fast wait-free algorithms designed for shared memory systems
  ☆46Updated 7 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆249Updated 3 years ago
• flode / ARTSynchronized
  ☆119Updated 3 years ago
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆57Updated last year
• compudj / librseq
  Library for Restartable Sequences
  ☆72Updated last month