Alternatives and similar repositories for foedus

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

• HewlettPackard / foedus_code
  FOEDUS main source code repository
  ☆64Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆395Updated 8 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆447Updated 2 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆31Updated 7 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• wangziqi2016 / index-microbench
  ☆151Updated 2 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆105Updated 7 years ago
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆76Updated 5 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated last year
• microsoft / pmwcas
  pmwcas
  ☆139Updated 2 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆48Updated 2 years ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 7 years ago
• huanchenz / index-microbench
  ☆15Updated 8 years ago
• flode / ARTSynchronized
  ☆124Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆159Updated 6 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆117Updated 2 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)
  ☆83Updated 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
• 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
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• apache / incubator-retired-quickstep
  Apache Quickstep Incubator - This project is retired
  ☆94Updated 6 years ago
• efficient / memc3
  MemC3
  ☆156Updated 8 years ago
• silt / silt
  SILT: A Memory-Efficient, High-Performance Key-Value Store
  ☆177Updated 3 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year