epfl-dias / proteusLinks
Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardware and workloads through a combination of GPU acceleration, data virtualization, and adaptive scheduling.
☆26Updated 2 years ago
Alternatives and similar repositories for proteus
Users that are interested in proteus are comparing it to the libraries listed below
Sorting:
- ☆81Updated 4 months ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- A Database System for Research and Fast Prototyping☆112Updated 2 months ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- A query compiler for GPUs that translates relational algebra to Cuda.☆20Updated 2 years ago
- GPU library for writing SQL queries☆85Updated last year
- Snowflake dataset containing statistics for 70 million queries over 14 day period☆115Updated 4 years ago
- ☆150Updated 2 years ago
- Star Schema Benchmark data set generator (dbgen) - unified repository☆39Updated 9 months ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 9 months ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆15Updated 2 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆26Updated last year
- Optimizing data-intensive systems in disaggregated data centers☆13Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Implementation of the algorithm described in "Hardware-conscious Hash-Joins on GPUs" paper presented in ICDE 2019☆34Updated 5 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 9 months ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- Quickstep project☆44Updated last year
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆70Updated last month
- ☆75Updated 10 months ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- Sundial: A distributed OLTP database testbed.☆39Updated 5 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated 3 weeks ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆48Updated 7 months ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 5 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Updated 2 years ago
- Model implementation and explorative UI for the paper "Towards Cost-Optimal Query Processing in the Cloud". Slides: https://bit.ly/37ZfeP…☆15Updated 4 months ago
- ☆30Updated 6 years ago