Alternatives and similar repositories for bt

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

• rmind / libqsbr
  QSBR and EBR library
  ☆133Updated 5 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆158Updated 6 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆99Updated 7 years ago
• gburd / libumem
  This is the user space slab memory allocator, umem, first available in Solaris 9.
  ☆90Updated 3 years ago
• Tokutek / ft-index
  This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.
  ☆95Updated 6 years ago
• aclements / sv6
  POSIX-like scalable multicore research OS kernel
  ☆195Updated 5 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆93Updated 2 years ago
• PlatformLab / Arachne
  Core aware thread management system
  ☆239Updated 2 years ago
• hgst / libnvme
  User level NVMe driver library
  ☆70Updated 4 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• bbu / userland-slab-allocator
  A carefully optimised, POSIX-compatible slab allocator for userspace.
  ☆80Updated 9 years ago
• oscarlab / betrfs
  ☆294Updated last year
• sphurti / Log-Structured-Filesystem
  LFS using Fuse
  ☆46Updated 13 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆47Updated 12 years ago
• acozzette / BUSE
  A block device in user space for Linux
  ☆247Updated 2 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…
  ☆181Updated 7 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• malbrain / Btree-source-code
  A working project for High-concurrency B-tree source code in C
  ☆251Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• mit-pdos / scalefs
  ☆21Updated 8 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 15 years ago
• pmem / vmemcache
  Buffer based LRU cache
  ☆40Updated 2 years ago
• ydmao / Metis
  MapReduce for multi-core
  ☆49Updated 12 years ago
• oracle / nvm-direct
  A C library to support applications that map Non-Volatile Memory into their address space for load/store access.
  ☆57Updated 6 years ago
• littledan / linux-aio
  How to use the Linux AIO feature
  ☆339Updated 2 years ago
• compudj / librseq
  Library for Restartable Sequences
  ☆74Updated last week