Alternatives and similar repositories for sphinx

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

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• romange / midi-redis
  A toy memory store with great performance
  ☆37Updated last month
• unodb-dev / unodb
  Adaptive Radix Tree in C++
  ☆50Updated this week
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• cacheMon / libCacheSim
  a high performance cache simulator and library
  ☆112Updated last year
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆72Updated 10 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.
  ☆167Updated 4 years ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆94Updated 2 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆107Updated 5 months ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 5 years ago
• viktorleis / mmapbench
  ☆148Updated 3 years ago
• L-v-M / async
  ☆20Updated 3 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆49Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• RedisLabs / raft
  C implementation of the Raft Consensus protocol, BSD licensed
  ☆82Updated 2 years ago
• cruzdb / cruzdb
  Append-only key-value database on a distributed shared-log
  ☆52Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• frevib / epoll-echo-server
  ☆53Updated 5 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 10 months ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆42Updated last year
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆101Updated 9 years ago
• sanastas / LockFreeBtree
  The code for the paper: "A Lock-Free B+Tree" Anastasia Braginsky and Erez Petrank, SPAA'12, June 2012.
  ☆15Updated 9 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
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆139Updated 5 years ago
• tuhhosg / exmap
  ☆50Updated last year
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆48Updated 2 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 10 years ago