Alternatives and similar repositories for scalex

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

• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆135Updated 4 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
• efficient / cicada-engine
  The Cicada engine
  ☆57Updated 8 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆75Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 6 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆154Updated 6 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• Shao-Jie / SkimpyStash
  A key/value database based on SkimpyStash.
  ☆13Updated 10 years ago
• CatKang / Solitaire
  Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model
  ☆17Updated 6 years ago
• L-v-M / async
  ☆20Updated 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…
  ☆180Updated 7 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆60Updated 6 years ago
• cmu-db / peloton-design
  Peloton Design Docs
  ☆27Updated 6 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)
  ☆80Updated 3 years ago
• rlu-sync / rlu
  Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming
  ☆48Updated 9 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 8 months ago
• 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
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• daq-db / daqdb
  DB for DAQ systems based on Persistent Memory and NVMe drives
  ☆21Updated 5 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆90Updated 2 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 14 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 3 years ago