35 citations · 160 across the 33 of their papers we have counts for
4 papers · 1 filter
Comprehensive and Efficient Workload Compression
Shaleen Deep, Anja Gruenheid, Paraschos Koutris +2
This work studies the problem of constructing a representative workload from a given input analytical query workload where the former serves as an approximation with guarantees of…
Algorithms for a Topology-aware Massively Parallel Computation Model
Xiao Hu, Paraschos Koutris, Spyros Blanas
Most of the prior work in massively parallel data processing assumes homogeneity, i.e., every computing unit has the same computational capability, and can communicate with every o…
A Comparative Exploration of ML Techniques for Tuning Query Degree of Parallelism
Zhiwei Fan, Rathijit Sen, Paraschos Koutris +1
There is a large body of recent work applying machine learning (ML) techniques to query optimization and query performance prediction in relational database management systems (RDB…
Fast Join Project Query Evaluation using Matrix Multiplication
Shaleen Deep, Xiao Hu, Paraschos Koutris
In the last few years, much effort has been devoted to developing join algorithms in order to achieve worst-case optimality for join queries over relational databases. Towards this…