29 citations · 121 across the 13 of their papers we have counts for
14 papers
Holistic Cube Analysis: A Query Framework for Data Insights
Xi Wu, Shaleen Deep, Joe Benassi +11
Many data insight questions can be viewed as searching in a large space of tables and finding important ones, where the notion of importance is defined in some adhoc user defined m…
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…
Efficient sorting, duplicate removal, grouping, and aggregation
Thanh Do, Goetz Graefe, Jeffrey Naughton
Database query processing requires algorithms for duplicate removal, grouping, and aggregation. Three algorithms exist: in-stream aggregation is most efficient by far but requires…
Providing Insights for Queries affected by Failures and Stragglers
Bruhathi Sundarmurthy, Harshad Deshmukh, Paris Koutris +1
Interactive time responses are a crucial requirement for users analyzing large amounts of data. Such analytical queries are typically run in a distributed setting, with data being…
Tuple-oriented Compression for Large-scale Mini-batch Stochastic Gradient Descent
Fengan Li, Lingjiao Chen, Yijing Zeng +4
Data compression is a popular technique for improving the efficiency of data processing workloads such as SQL queries and more recently, machine learning (ML) with classical batch…
Towards Linear Algebra over Normalized Data
Lingjiao Chen, Arun Kumar, Jeffrey Naughton +1
Providing machine learning (ML) over relational data is a mainstream requirement for data analytics systems. While almost all the ML tools require the input data to be presented as…