Alternatives and similar repositories for modern_dbs:

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

• Henning1 / dogqc
  A query compiler for GPUs that translates relational algebra to Cuda.
  ☆20Updated last year
• viktorleis / vmcache
  ☆62Updated 10 months ago
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆27Updated 2 years ago
• tum-db / TardisDB
  A code-generating database system with incorporated versioning commands in SQL.
  ☆14Updated 4 years ago
• jiashu-z / how-to-plot
  How to plot for papers, slides, demos, etc.
  ☆10Updated 2 years ago
• harvard-cns / Harvard-CNS-Seminar
  Reading seminar in Harvard Cloud Networking and Systems Group
  ☆16Updated 2 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆102Updated last month
• Trinity-data-store / Trinity
  EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"
  ☆17Updated 9 months ago
• zxjcarrot / spitfire
  Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory
  ☆38Updated 2 years ago
• CloudOLTP / Cornus
  ☆21Updated 2 years ago
• chenhao-ye / polaris
  Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”
  ☆24Updated last year
• zxjcarrot / 2-Tree
  Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…
  ☆33Updated 3 weeks ago
• SJTU-IPADS / vegito
  ☆52Updated last year
• tidb-incubator / vldbss-2021
  ☆22Updated 3 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆52Updated 4 months ago
• sfu-dis / preemptdb
  Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)
  ☆42Updated last month
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆14Updated 5 years ago
• UWHustle / HATtrick
  ☆30Updated 2 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 3 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆15Updated 4 years ago
• alexandervanrenen / cab
  A benchmark for serverless analytic databases.
  ☆19Updated 5 months ago
• sfu-dis / tesseract
  Tesseract: Efficient Online Schema Evolution for Snapshot Databases (VLDB 2023)
  ☆23Updated last year
• CASP-Systems-BU / Gadget
  A Benchmark Harness for Systematic and Robust Evaluation of Streaming State Stores
  ☆17Updated 9 months ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 8 months ago
• thu-pacman / TriCache
  A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs
  ☆74Updated last year
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆43Updated 9 months ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months ago
• saramcallister / Kangaroo
  ☆34Updated 3 years ago