Planning in Compute-Aggregate Problems as Optimization Problems on Graphs
| dc.contributor.author | Chuprikov, Pavel | |
| dc.contributor.author | Davydow, Alex | |
| dc.contributor.author | Kogan, Kirill | |
| dc.contributor.author | Nikolenko, Sergey | |
| dc.contributor.author | Sirotkin, Alexander V. | |
| dc.date.accessioned | 2021-07-13T09:30:37Z | |
| dc.date.available | 2021-07-13T09:30:37Z | |
| dc.date.issued | 2017-10-13 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12761/432 | |
| dc.description.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. | |
| dc.language.iso | eng | |
| dc.title | Planning in Compute-Aggregate Problems as Optimization Problems on Graphs | en |
| dc.type | conference object | |
| dc.conference.date | 10-13 October 2017 | |
| dc.conference.place | Toronto, Canada | |
| dc.conference.title | The 25th IEEE International Conference on Network Protocols (IEEE ICNP 2017) | * |
| dc.event.type | conference | |
| dc.pres.type | poster | |
| dc.type.hasVersion | VoR | |
| dc.rights.accessRights | open access | |
| dc.page.final | 2 | |
| dc.page.initial | 1 | |
| dc.description.refereed | TRUE | |
| dc.description.status | pub | |
| dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1655 |
