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
- ☆30Updated 3 years ago
- ☆73Updated last month
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A low-latency, extensible, multi-tenant key-value store.☆55Updated 4 years ago
- ☆48Updated last year
- A code-generating database system with incorporated versioning commands in SQL.☆13Updated 4 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 months ago
- Multi-core Window-Based Stream Processing Engine☆73Updated 4 years ago
- Quickstep project☆42Updated 11 months ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 5 years ago
- EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"☆19Updated 7 months ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago
- ☆54Updated last year
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆124Updated last year
- ☆53Updated 2 years ago
- A distributed database benchmark based on TAO's workload☆42Updated last year
- In-memory, columnar, arrow-based database.☆48Updated 3 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆24Updated last year
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆46Updated 2 years ago
- A decentralized scalar timestamp scheme☆16Updated 4 years ago
- ☆15Updated 3 weeks ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆66Updated last month
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆60Updated 6 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago