11 citations · 12 across the 4 of their papers we have counts for
14 papers
Ranked Enumeration of Join Queries with Projections
Shaleen Deep, Xiao Hu, Paraschos Koutris
Join query evaluation with ordering is a fundamental data processing task in relational database management systems. SQL and custom graph query languages such as Cypher offer this…
Certifiable Robustness for Nearest Neighbor Classifiers
Austen Z. Fan, Paraschos Koutris
ML models are typically trained using large datasets of high quality. However, training datasets often contain inconsistent or incomplete data. To tackle this issue, one solution i…
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…
Revenue Maximization for Query Pricing
Shuchi Chawla, Shaleen Deep, Paraschos Koutris +1
Buying and selling of data online has increased substantially over the last few years. Several frameworks have already been proposed that study query pricing in theory and practice…