Alternatives and similar repositories for foedus_code

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

• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆65Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 2 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆39Updated 5 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 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
• 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
• wangziqi2016 / index-microbench
  ☆149Updated 2 years ago
• stephentu / silo
  Multicore in-memory storage engine
  ☆394Updated 8 years ago
• flode / ARTSynchronized
  ☆122Updated 3 years ago
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆76Updated 4 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆104Updated 7 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆446Updated 2 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆211Updated 9 years ago
• mkaguilera / yesquel
  Yesquel: scalable SQL storage for Web apps
  ☆42Updated 8 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)
  ☆82Updated 3 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆99Updated 9 years ago
• yxymit / DBx1000
  ☆291Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• microsoft / pmwcas
  pmwcas
  ☆138Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 7 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
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆194Updated last year
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆30Updated 7 years ago
• readablesystems / sto
  Software Transactional Objects
  ☆56Updated last year
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆157Updated 6 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago