{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:08:58Z","timestamp":1755839338120,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Key-Area Research and Development Program of Guangdong Province 2020B0101390001, National Natural Science Foundation of China (NSFC)","award":["No. U20A20179, 61832001"],"award-info":[{"award-number":["No. U20A20179, 61832001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3526160","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"744-758","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["MinMax Sampling: A Near-optimal Global Summary for Aggregation in the Wide Area"],"prefix":"10.1145","author":[{"given":"Yikai","family":"Zhao","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Yinda","family":"Zhang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Yuanpeng","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Chunhui","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University & Peng Cheng Laboratory, Beijing, China"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Source code related to algo. https:\/\/github.com\/Arimase97\/MinMax-Sampling."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787475"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380593"},{"key":"e_1_3_2_1_4_1","first-page":"1493","volume-title":"SIGMOD Conference 2020","author":"Taft Rebecca","year":"2020","unstructured":"Rebecca Taft, Irfan Sharif, Andrei Matei, Nathan VanBenschoten, Jordan Lewis, Tobias Grieger, Kai Niemi, Andy Woods, Anne Birzin, Raphael Poss, Paul Bardea, Amruta Ranade, Ben Darnell, Bram Gruneir, Justin Jaffray, Lucy Zhang, and Peter Mattis. Cockroachdb: The resilient geo-distributed SQL database. In SIGMOD Conference 2020, pages 1493--1509. ACM, 2020."},{"key":"e_1_3_2_1_5_1","first-page":"1087","volume-title":"SIGMOD Conference 2015","author":"Vulimiri Ashish","year":"2015","unstructured":"Ashish Vulimiri, Carlo Curino, Philip Brighten Godfrey, Thomas Jungblut, Konstantinos Karanasos, Jitendra Padhye, and George Varghese. Wanalytics: Geo-distributed analytics for a data intensive world. In SIGMOD Conference 2015, pages 1087--1092. ACM, 2015."},{"key":"e_1_3_2_1_6_1","first-page":"629","volume-title":"NSDI 2017","author":"Hsieh Kevin","year":"2017","unstructured":"Kevin Hsieh, Aaron Harlap, Nandita Vijaykumar, Dimitris Konomis, Gregory R. Ganger, Phillip B. Gibbons, and Onur Mutlu. Gaia: Geo-distributed machine learning approaching LAN speeds. In NSDI 2017, pages 629--647. USENIX Association, 2017."},{"key":"e_1_3_2_1_7_1","first-page":"275","volume-title":"NSDI 2014","author":"Rabkin Ariel","year":"2014","unstructured":"Ariel Rabkin, Matvey Arye, Siddhartha Sen, Vivek S. Pai, and Michael J. Freedman. Aggregation and degradation in jetstream: Streaming analytics in the wide area. In NSDI 2014, pages 275--288. USENIX Association, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177099"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142394"},{"issue":"4","key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Wireless sensor network: a review on data aggregation","volume":"2","author":"Maraiya Kiran","year":"2011","unstructured":"Kiran Maraiya, Kamal Kant, and Nitin Gupta. Wireless sensor network: a review on data aggregation. International Journal of Scientific & Engineering Research, 2(4):1--6, 2011.","journal-title":"International Journal of Scientific & Engineering Research"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066191"},{"key":"e_1_3_2_1_12_1","volume-title":"Ananda Theertha Suresh, and Dave Bacon. Federated learning: Strategies for improving communication efficiency. CoRR, abs\/1610.05492","author":"Jakub Konevc","year":"2016","unstructured":"Jakub Konevc n\u00fd, H. Brendan McMahan, Felix X. Yu, Peter Richt\u00e1 rik, Ananda Theertha Suresh, and Dave Bacon. Federated learning: Strategies for improving communication efficiency. CoRR, abs\/1610.05492, 2016."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"e_1_3_2_1_14_1","first-page":"251","volume-title":"OSDI 2012","author":"Corbett James C.","year":"2012","unstructured":"James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, Wilson C. Hsieh, Sebastian Kanthak, Eugene Kogan, Hongyi Li, Alexander Lloyd, Sergey Melnik, David Mwaura, David Nagle, Sean Quinlan, Rajesh Rao, Lindsay Rolig, Yasushi Saito, Michal Szymaniak, Christopher Taylor, Ruth Wang, and Dale Woodford. Spanner: Google's globally-distributed database. In OSDI 2012, pages 251--264. USENIX Association, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732999"},{"key":"e_1_3_2_1_16_1","first-page":"323","volume-title":"NSDI 15","author":"Vulimiri Ashish","year":"2015","unstructured":"Ashish Vulimiri, Carlo Curino, Philip Brighten Godfrey, Thomas Jungblut, Jitu Padhye, and George Varghese. Global analytics in the face of bandwidth and regulatory constraints. In NSDI 15, pages 323--336. USENIX Association, 2015."},{"key":"e_1_3_2_1_17_1","first-page":"53","volume-title":"LISA '14","author":"Alspaugh Sara","year":"2014","unstructured":"Sara Alspaugh, Bei Di Chen, Jessica Lin, Archana Ganapathi, Marti A. Hearst, and Randy H. Katz. Analyzing log analysis: An empirical study of user log mining. In LISA '14, pages 53--68. USENIX Association, 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1111"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230554"},{"key":"e_1_3_2_1_20_1","first-page":"8253","volume-title":"ICML 2020","volume":"119","author":"Rothchild Daniel","year":"2020","unstructured":"Daniel Rothchild, Ashwinee Panda, Enayat Ullah, Nikita Ivkin, Ion Stoica, Vladimir Braverman, Joseph Gonzalez, and Raman Arora. Fetchsgd: Communication-efficient federated learning with sketching. In ICML 2020, volume 119, pages 8253--8265. PMLR, 2020."},{"key":"e_1_3_2_1_21_1","first-page":"13144","volume-title":"NeurIPS 2019","author":"Ivkin Nikita","year":"2019","unstructured":"Nikita Ivkin, Daniel Rothchild, Enayat Ullah, Vladimir Braverman, Ion Stoica, and Raman Arora. Communication-efficient distributed SGD with sketching. In NeurIPS 2019, pages 13144--13154, 2019."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601861"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403208"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183759"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749443"},{"key":"e_1_3_2_1_30_1","first-page":"2319","volume-title":"KDD 2018","author":"Ting Daniel","year":"2018","unstructured":"Daniel Ting. Count-min: Optimal estimation and tight error bounds using empirical error distributions. In KDD 2018, pages 2319--2328. ACM, 2018."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935005"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066161"},{"key":"e_1_3_2_1_33_1","first-page":"4452","volume-title":"NeurIPS 2018","author":"Stich Sebastian U.","year":"2018","unstructured":"Sebastian U. Stich, Jean-Baptiste Cordonnier, and Martin Jaggi. Sparsified SGD with memory. In NeurIPS 2018, pages 4452--4463, 2018."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2019.8888042"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183735"},{"key":"e_1_3_2_1_36_1","volume-title":"Sorting: A distribution theory","author":"Mahmoud Hosam M","year":"2011","unstructured":"Hosam M Mahmoud. Sorting: A distribution theory, volume 54. John Wiley & Sons, 2011."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127580"},{"key":"e_1_3_2_1_38_1","volume-title":"ICLR 2018","author":"Lin Yujun","year":"2018","unstructured":"Yujun Lin, Song Han, Huizi Mao, Yu Wang, and Bill Dally. Deep gradient compression: Reducing the communication bandwidth for distributed training. In ICLR 2018. OpenReview.net, 2018."},{"key":"e_1_3_2_1_39_1","first-page":"1306","volume-title":"NeurIPS 2018","author":"Wangni Jianqiao","year":"2018","unstructured":"Jianqiao Wangni, Jialei Wang, Ji Liu, and Tong Zhang. Gradient sparsification for communication-efficient distributed optimization. In NeurIPS 2018, pages 1306--1316, 2018."},{"key":"e_1_3_2_1_40_1","volume-title":"Learning multiple layers of features from tiny images. Master's thesis","author":"Krizhevsky A","year":"2009","unstructured":"A Krizhevsky. Learning multiple layers of features from tiny images. Master's thesis, University of Tront, 2009."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"e_1_3_2_1_42_1","volume-title":"Peter Wu, Tian Li, Jakub Konevc n\u1ef3, H Brendan McMahan, Virginia Smith, and Ameet Talwalkar. Leaf: A benchmark for federated settings. arXiv preprint arXiv:1812.01097","author":"Caldas Sebastian","year":"2018","unstructured":"Sebastian Caldas, Sai Meher Karthik Duddu, Peter Wu, Tian Li, Jakub Konevc n\u1ef3, H Brendan McMahan, Virginia Smith, and Ameet Talwalkar. Leaf: A benchmark for federated settings. arXiv preprint arXiv:1812.01097, 2018."},{"key":"e_1_3_2_1_43_1","first-page":"2921","volume-title":"IJCNN 2017","author":"Cohen Gregory","year":"2017","unstructured":"Gregory Cohen, Saeed Afshar, Jonathan Tapson, and Andre Van Schaik. Emnist: Extending mnist to handwritten letters. In IJCNN 2017, pages 2921--2926. IEEE, 2017."},{"key":"e_1_3_2_1_44_1","unstructured":"textThe CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472892"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849370"},{"key":"e_1_3_2_1_47_1","first-page":"1273","volume-title":"AISTATS 2017","volume":"54","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Ag\u00fc era y Arcas. Communication-efficient learning of deep networks from decentralized data. In AISTATS 2017, volume 54, pages 1273--1282. PMLR, 2017."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378161"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5793"},{"key":"e_1_3_2_1_50_1","volume-title":"Locally differentially private sparse vector aggregation. CoRR, abs\/2112.03449","author":"Zhou Mingxun","year":"2021","unstructured":"Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, and Elaine Shi. Locally differentially private sparse vector aggregation. CoRR, abs\/2112.03449, 2021."},{"key":"e_1_3_2_1_51_1","first-page":"3252","volume-title":"ICML 2019","volume":"97","author":"Karimireddy Sai Praneeth","year":"2019","unstructured":"Sai Praneeth Karimireddy, Quentin Rebjock, Sebastian U. Stich, and Martin Jaggi. Error feedback fixes signsgd and other gradient compression schemes. In ICML 2019, volume 97, pages 3252--3261. PMLR, 2019."},{"key":"e_1_3_2_1_52_1","first-page":"34","article-title":"Rethinking gradient sparsification as total error minimization","author":"Sahu Atal","year":"2021","unstructured":"Atal Sahu, Aritra Dutta, Ahmed M Abdelmoniem, Trambak Banerjee, Marco Canini, and Panos Kalnis. Rethinking gradient sparsification as total error minimization. Advances in Neural Information Processing Systems, 34, 2021.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_53_1","first-page":"559","volume-title":"ICML 2018","volume":"80","author":"Bernstein Jeremy","year":"2018","unstructured":"Jeremy Bernstein, Yu-Xiang Wang, Kamyar Azizzadenesheli, and Animashree Anandkumar. SIGNSGD: compressed optimisation for non-convex problems. In ICML 2018, volume 80, pages 559--568. PMLR, 2018."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00060"},{"key":"e_1_3_2_1_55_1","volume-title":"Deepreduce: A sparse-tensor communication framework for distributed deep learning. arXiv preprint arXiv:2102.03112","author":"Kostopoulou Kelly","year":"2021","unstructured":"Kelly Kostopoulou, Hang Xu, Aritra Dutta, Xin Li, Alexandros Ntoulas, and Panos Kalnis. Deepreduce: A sparse-tensor communication framework for distributed deep learning. arXiv preprint arXiv:2102.03112, 2021."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467217"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196894"},{"key":"e_1_3_2_1_58_1","volume-title":"Robust and communication-efficient federated learning from non-iid data","author":"Sattler Felix","year":"2019","unstructured":"Felix Sattler, Simon Wiedemann, Klaus-Robert M\u00fcller, and Wojciech Samek. Robust and communication-efficient federated learning from non-iid data. IEEE transactions on neural networks and learning systems, 31(9):3400--3413, 2019."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526160","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3526160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:13Z","timestamp":1750183813000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3526160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":59,"alternative-id":["10.1145\/3514221.3526160","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3526160","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}