TU-Berlin-DIMA / grizzly-prototypeLinks
Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
☆16Updated 5 years ago
Alternatives and similar repositories for grizzly-prototype
Users that are interested in grizzly-prototype are comparing it to the libraries listed below
Sorting:
- ☆15Updated 5 years ago
- Multi-core Window-Based Stream Processing Engine☆72Updated 3 years ago
- simd enabled column imprints☆11Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆24Updated last year
- ☆47Updated last year
- ☆54Updated last year
- GitHub Repo for STAR: Scaling Transactions through Asymmetric Replication☆22Updated 6 years ago
- ☆29Updated 2 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A code-generating database system with incorporated versioning commands in SQL.☆13Updated 4 years ago
- A query compiler for GPUs that translates relational algebra to Cuda.☆21Updated last year
- ☆70Updated 3 months ago
- Quickstep project☆42Updated 8 months ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆20Updated 2 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- Go Version of Redis on PMEM☆12Updated 3 years ago
- LazyLog: A New Shared Log Abstraction for Low-Latency Applications☆26Updated 2 months ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 3 months ago
- ☆20Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆61Updated 2 months ago
- ☆14Updated 2 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ☆38Updated 5 years ago
- In-memory, columnar, arrow-based database.☆48Updated 2 years ago
- ☆28Updated 4 years ago
- ☆19Updated 6 months ago