Planning in compute-aggregate problems as optimization problems on graphs

Pavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey I. Nikolenko, Alexander V. Sirotkin

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.