Alternatives and similar repositories for cssl

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

• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 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
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆62Updated 6 years ago
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆136Updated 4 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆101Updated 6 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.
  ☆166Updated 3 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 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
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆155Updated 6 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• belliottsmith / accord
  ☆27Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆123Updated 5 years ago
• tuhhosg / exmap
  ☆48Updated last year
• viktorleis / vmcache
  ☆72Updated 4 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago