Alternatives and similar repositories for foedus_code:

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

• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• HewlettPackard / foedus
  FOEDUS: Fast Optimistic Engine for Data Unification Services
  ☆66Updated 7 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆103Updated 6 years ago
• thawk105 / ccbench
  Concurrency Control Benchmark
  ☆47Updated last year
• wangziqi2016 / index-microbench
  ☆143Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆114Updated 2 years ago
• caetanosauer / zero
  Fork of the Shore-MT storage manager used by the research project Instant Recovery
  ☆29Updated 6 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆55Updated 7 years ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• microsoft / pmwcas
  pmwcas
  ☆136Updated last year
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆100Updated 6 years ago
• HewlettPackard / Atlas
  Atlas: Programming for Persistent Memory
  ☆75Updated 4 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆55Updated 5 months ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆113Updated 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)
  ☆78Updated 2 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆152Updated 5 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated last year
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 5 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• efficient / mica
  MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)
  ☆207Updated 9 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cosmoss-jigu / hydralist
  ☆28Updated 2 years ago
• tuhhosg / exmap
  ☆43Updated 11 months ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• yxymit / DBx1000
  ☆285Updated 2 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 7 years ago
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆110Updated 6 years ago