Alternatives and similar repositories for StreamBenchmarks

Users that are interested in StreamBenchmarks 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
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 3 years ago
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆55Updated 4 years ago
• wheatman / BP-Tree
  ☆15Updated 8 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• ForestDB-KVStore / forestdb
  A fork of Couchbase ForestDB project, aiming at making it simple and generic
  ☆18Updated 6 months ago
• ParaGroup / WindFlow
  A C++17 Data Stream Processing Parallel Library for Multicores and GPUs
  ☆85Updated 7 months ago
• cosmoss-jigu / hydralist
  ☆30Updated 3 years ago
• luyi0619 / star
  GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication
  ☆22Updated 6 years ago
• dsrhaslab / paio
  PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)
  ☆24Updated 2 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 months ago
• hydro-project / anna-cache
  A local cache for the Anna KVS
  ☆25Updated 5 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
• madsys-dev / async-spdk
  Asynchronous Rust bindings for SPDK.
  ☆17Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• vmware-archive / go-redis-pmem
  Go Version of Redis on PMEM
  ☆12Updated 3 years ago
• flexible-address-space / flexspace
  Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22
  ☆21Updated 6 months ago
• SJTU-IPADS / dst
  A decentralized scalar timestamp scheme
  ☆16Updated 4 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆47Updated last week
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• DBOS-project / dbos-scheduler
  ☆28Updated 4 years ago
• caetanosauer / foster-btree
  A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure
  ☆15Updated 6 years ago
• ix-project / zygos
  ☆32Updated 8 years ago
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆46Updated 2 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆78Updated 4 years ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆48Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago