Alternatives and similar repositories for sphinx:

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

• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• romange / midi-redis
  A toy memory store with great performance
  ☆34Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆44Updated 2 weeks ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 4 years ago
• PLW / blink-tree-logic
  BLInk Tree logic - storage and locking experiment
  ☆27Updated 10 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆71Updated last year
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 5 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆19Updated 3 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• coinrust / erpc-rs
  eRPC library for Rust
  ☆14Updated 5 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆104Updated 7 months ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• tuhhosg / exmap
  ☆45Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆58Updated 6 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆65Updated 9 years ago
• cruzdb / cruzdb
  Append-only key-value database on a distributed shared-log
  ☆49Updated 8 months ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆23Updated last week
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆39Updated 11 months ago
• viktorleis / mmapbench
  ☆137Updated 2 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆103Updated 8 months ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)
  ☆53Updated this week
• rusnikola / lfqueue
  A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)
  ☆56Updated last year
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 14 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆40Updated 3 years ago
• frevib / epoll-echo-server
  ☆50Updated 5 years ago