LPD-EPFL / flodb

Related projects ⓘ

Alternatives and complementary repositories for flodb

• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆44Updated 2 years ago
• pmem / pmse
  Persistent Memory Storage Engine
  ☆24Updated 2 weeks ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆96Updated last year
• cosmoss-jigu / hydralist
  ☆27Updated 2 years ago
• hyrise / nvm_malloc
  ☆25Updated 8 years ago
• hku-systems / apus
  An RDMA-powered, fast, and scalable Paxos protocol
  ☆25Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• epfl-labos / TRIAD
  ☆43Updated 3 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆41Updated last year
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 6 months ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 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)
  ☆76Updated 2 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last month
• tuhhosg / exmap
  ☆37Updated 7 months ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated last month
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• flode / ARTSynchronized
  ☆115Updated 2 years ago
• L-v-M / async
  ☆21Updated last year
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆54Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆46Updated 3 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• shuaimu / rococo
  ☆35Updated 9 months ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆21Updated last year