IMDEA Networks Institute Publications Repository

Planning in Compute-Aggregate Problems as Optimization Problems on Graphs

Chuprikov, Pavel and Davydow, Alex and Kogan, Kirill and Nikolenko, Sergey and Sirotkin, Alexander V. (2017) Planning in Compute-Aggregate Problems as Optimization Problems on Graphs. In: The 25th IEEE International Conference on Network Protocols (IEEE ICNP 2017), 10-13 October 2017, Toronto, Canada.

[img] PDF (Planning in Compute-Aggregate Problems as Optimization Problems on Graphs) - Published Version
Download (244Kb)

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.

Item Type: Conference or Workshop Papers (Poster)
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Kirill Kogan
Date Deposited: 05 Sep 2017 10:14
Last Modified: 05 Sep 2017 10:14
URI: http://eprints.networks.imdea.org/id/eprint/1655

Actions (login required)

View Item View Item