Alternatives and similar repositories for CUBIT

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

• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• tuhhosg / exmap
  ☆50Updated last year
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• viktorleis / vmcache
  ☆81Updated 5 months ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆28Updated 8 months ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 6 months ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆48Updated 2 years ago
• wheatman / BP-Tree
  ☆16Updated last year
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆127Updated last year
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 6 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• umbra-db / colibri-vldb2024
  Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"
  ☆25Updated last year
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 10 months ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆39Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 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
• dassl-uiuc / LazyLog-Artifact
  LazyLog: A New Shared Log Abstraction for Low-Latency Applications
  ☆43Updated 9 months ago
• SJTU-IPADS / hackwrench
  ☆12Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 7 years ago
• HaoyuHuang / NovaLSM
  Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.
  ☆52Updated 4 years ago
• viktorleis / mmapbench
  ☆148Updated 3 years ago
• DICL / listdb
  ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory
  ☆49Updated last year
• njulands / HashAdaptiveBF
  ☆16Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• saramcallister / Kangaroo
  ☆35Updated 4 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆61Updated 9 months ago
• PDS-Lab / GearDB
  GearDB: A GC-free Key-Value Store on HM-SMR Drives with Gear Compaction
  ☆40Updated 6 years ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆27Updated 2 years ago