Planning in Compute-Aggregate Problems as Optimization Problems on Graphs

Abstract

Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.