Planning in compute-aggregate problems as optimization problems on graphs

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

doi:10.1109/ICNP.2017.8117579

Planning in compute-aggregate problems as optimization problems on graphs

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	2017 IEEE 25th International Conference on Network Protocols, ICNP 2017
Publisher	IEEE Computer Society
ISBN (Electronic)	9781509065011
DOIs	https://doi.org/10.1109/ICNP.2017.8117579
State	Published - 21 Nov 2017
Externally published	Yes
Event	25th IEEE International Conference on Network Protocols, ICNP 2017 - Toronto, Canada Duration: 10 Oct 2017 → 13 Oct 2017

Publication series

Name	Proceedings - International Conference on Network Protocols, ICNP
Volume	2017-October
ISSN (Print)	1092-1648

Conference

Conference	25th IEEE International Conference on Network Protocols, ICNP 2017
Country/Territory	Canada
City	Toronto
Period	10/10/17 → 13/10/17

Access to Document

10.1109/ICNP.2017.8117579

Cite this

Chuprikov, P., Davydow, A., Kogan, K., Nikolenko, S. I., & Sirotkin, A. V. (2017). Planning in compute-aggregate problems as optimization problems on graphs. In 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017 Article 8117579 (Proceedings - International Conference on Network Protocols, ICNP; Vol. 2017-October). IEEE Computer Society. https://doi.org/10.1109/ICNP.2017.8117579

@inproceedings{016282e198a44d2f83221a4bbd599509,

title = "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.",

author = "Pavel Chuprikov and Alex Davydow and Kirill Kogan and Nikolenko, \{Sergey I.\} and Sirotkin, \{Alexander V.\}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 25th IEEE International Conference on Network Protocols, ICNP 2017 ; Conference date: 10-10-2017 Through 13-10-2017",

year = "2017",

month = nov,

day = "21",

doi = "10.1109/ICNP.2017.8117579",

language = "אנגלית",

series = "Proceedings - International Conference on Network Protocols, ICNP",

publisher = "IEEE Computer Society",

booktitle = "2017 IEEE 25th International Conference on Network Protocols, ICNP 2017",

address = "ארצות הברית",

}

Chuprikov, P, Davydow, A, Kogan, K, Nikolenko, SI & Sirotkin, AV 2017, Planning in compute-aggregate problems as optimization problems on graphs. in 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017., 8117579, Proceedings - International Conference on Network Protocols, ICNP, vol. 2017-October, IEEE Computer Society, 25th IEEE International Conference on Network Protocols, ICNP 2017, Toronto, Canada, 10/10/17. https://doi.org/10.1109/ICNP.2017.8117579

Planning in compute-aggregate problems as optimization problems on graphs. / Chuprikov, Pavel; Davydow, Alex; Kogan, Kirill et al.
2017 IEEE 25th International Conference on Network Protocols, ICNP 2017. IEEE Computer Society, 2017. 8117579 (Proceedings - International Conference on Network Protocols, ICNP; Vol. 2017-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Planning in compute-aggregate problems as optimization problems on graphs

AU - Chuprikov, Pavel

AU - Davydow, Alex

AU - Kogan, Kirill

AU - Nikolenko, Sergey I.

AU - Sirotkin, Alexander V.

PY - 2017/11/21

Y1 - 2017/11/21

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85041384542

U2 - 10.1109/ICNP.2017.8117579

DO - 10.1109/ICNP.2017.8117579

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85041384542

T3 - Proceedings - International Conference on Network Protocols, ICNP

BT - 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017

PB - IEEE Computer Society

T2 - 25th IEEE International Conference on Network Protocols, ICNP 2017

Y2 - 10 October 2017 through 13 October 2017

ER -

Planning in compute-aggregate problems as optimization problems on graphs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this