{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:08:10Z","timestamp":1783613290955,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014155","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Simons Collaboration on Algorithms and Geometry"],"award-info":[{"award-number":["Simons Collaboration on Algorithms and Geometry"]}],"id":[{"id":"10.13039\/100014155","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1704077, 1933331"],"award-info":[{"award-number":["CNS-1704077, 1933331"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Eric and Wendy Schmidt Fund for Strategic Innovation"},{"DOI":"10.13039\/100000008","name":"David and Lucile Packard Foundation","doi-asserted-by":"publisher","award":["Packard Fellowship in Science and Engineering"],"award-info":[{"award-number":["Packard Fellowship in Science and Engineering"]}],"id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,30]]},"DOI":"10.1145\/3387514.3405865","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T22:35:31Z","timestamp":1596148531000},"page":"226-239","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["BeauCoup"],"prefix":"10.1145","author":[{"given":"Xiaoqi","family":"Chen","sequence":"first","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shir","family":"Landau-Feibish","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Braverman","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485882"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646978.711822"},{"key":"e_1_3_2_2_3_1","volume-title":"Danny Raz, and Minlan Yu.","author":"Basat Ran Ben","year":"2020","unstructured":"Ran Ben Basat , Xiaoqi Chen , Gil Einziger , Shir Landau Feibish , Danny Raz, and Minlan Yu. 2020 . Routing Oblivious Measurement Analytics. In IFIP Networking . Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Shir Landau Feibish, Danny Raz, and Minlan Yu. 2020. Routing Oblivious Measurement Analytics. In IFIP Networking."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2982739"},{"key":"e_1_3_2_2_5_1","volume-title":"The CAIDA UCSD Anonymized Internet Traces 2018 - March 15th. (2018). https:\/\/www.caida.org\/data\/passive\/passive_dataset.xml","author":"CAIDA.","unstructured":"CAIDA. 2018. The CAIDA UCSD Anonymized Internet Traces 2018 - March 15th. (2018). https:\/\/www.caida.org\/data\/passive\/passive_dataset.xml CAIDA. 2018. The CAIDA UCSD Anonymized Internet Traces 2018 - March 15th. (2018). https:\/\/www.caida.org\/data\/passive\/passive_dataset.xml"},{"key":"e_1_3_2_2_6_1","volume-title":"Nonparametric estimation of the number of classes in a population. Scandinavian Journal of Statistics","author":"Chao Anne","year":"1984","unstructured":"Anne Chao . 1984. Nonparametric estimation of the number of classes in a population. Scandinavian Journal of Statistics ( 1984 ), 265--270. Anne Chao. 1984. Nonparametric estimation of the number of classes in a population. Scandinavian Journal of Statistics (1984), 265--270."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"e_1_3_2_2_8_1","volume-title":"Cisco Systems NetFlow Services Export Version 9. RFC 3954","author":"Claise Benoit","year":"2004","unstructured":"Benoit Claise . 2004. Cisco Systems NetFlow Services Export Version 9. RFC 3954 ( 2004 ). Benoit Claise. 2004. Cisco Systems NetFlow Services Export Version 9. RFC 3954 (2004)."},{"key":"e_1_3_2_2_9_1","unstructured":"The P4 Language Consortium. 2018. P416 Language Specifications. (2018). https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.0.0-spec.pdf  The P4 Language Consortium. 2018. P416 Language Specifications. (2018). https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.0.0-spec.pdf"},{"key":"e_1_3_2_2_10_1","volume-title":"Sketch techniques for approximate query processing. Foundations and Trends in Databases","author":"Cormode Graham","year":"2011","unstructured":"Graham Cormode . 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases . NOW publishers ( 2011 ). Graham Cormode. 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers (2011)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm. In Analysis of Algorithms (AOFA).  Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm. In Analysis of Algorithms (AOFA).","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90177-C"},{"key":"e_1_3_2_2_15_1","first-page":"541","article-title":"Distinct sampling for highly-accurate answers to distinct values queries and event reports","volume":"1","author":"Gibbons Phillip B","year":"2001","unstructured":"Phillip B Gibbons . 2001 . Distinct sampling for highly-accurate answers to distinct values queries and event reports . In VLDB , Vol. 1. 541 -- 550 . Phillip B Gibbons. 2001. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In VLDB, Vol. 1. 541--550.","journal-title":"VLDB"},{"key":"e_1_3_2_2_16_1","volume-title":"Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM. 357--371.","author":"Gupta Arpit","year":"2018","unstructured":"Arpit Gupta , Rob Harrison , Marco Canini , Nick Feamster , Jennifer Rexford , and Walter Willinger . 2018 . Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM. 357--371. Arpit Gupta, Rob Harrison, Marco Canini, Nick Feamster, Jennifer Rexford, and Walter Willinger. 2018. Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM. 357--371."},{"key":"e_1_3_2_2_17_1","volume-title":"Network-Wide Heavy Hitter Detection with Commodity Switches. In ACM SIGCOMM Symposium on SDN Research. 8:1-8:7.","author":"Harrison Rob","year":"2018","unstructured":"Rob Harrison , Qizhe Cai , Arpit Gupta , and Jennifer Rexford . 2018 . Network-Wide Heavy Hitter Detection with Commodity Switches. In ACM SIGCOMM Symposium on SDN Research. 8:1-8:7. Rob Harrison, Qizhe Cai, Arpit Gupta, and Jennifer Rexford. 2018. Network-Wide Heavy Hitter Detection with Commodity Switches. In ACM SIGCOMM Symposium on SDN Research. 8:1-8:7."},{"key":"e_1_3_2_2_18_1","volume-title":"Generic External Memory for Switch Data Planes. In ACM Workshop on Hot Topics in Networks. 1--7.","author":"Kim Daehyeok","year":"2018","unstructured":"Daehyeok Kim , Yibo Zhu , Changhoon Kim , Jeongkeun Lee , and Srinivasan Seshan . 2018 . Generic External Memory for Switch Data Planes. In ACM Workshop on Hot Topics in Networks. 1--7. Daehyeok Kim, Yibo Zhu, Changhoon Kim, Jeongkeun Lee, and Srinivasan Seshan. 2018. Generic External Memory for Switch Data Planes. In ACM Workshop on Hot Topics in Networks. 1--7."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746542"},{"key":"e_1_3_2_2_20_1","unstructured":"Yuliang Li Rui Miao Changhoon Kim and Minlan Yu. 2016. FlowRadar: A Better NetFlow for Data Centers. In USENIX NSDI. 311--324.  Yuliang Li Rui Miao Changhoon Kim and Minlan Yu. 2016. FlowRadar: A Better NetFlow for Data Centers. In USENIX NSDI. 311--324."},{"key":"e_1_3_2_2_21_1","volume-title":"Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, and Vyas Sekar.","author":"Liu Zaoxing","year":"2019","unstructured":"Zaoxing Liu , Ran Ben Basat , Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, and Vyas Sekar. 2019 . NitroSketch: Robust and general sketch-based monitoring in software switches. In ACM SIGCOMM. 334--350. Zaoxing Liu, Ran Ben Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, and Vyas Sekar. 2019. NitroSketch: Robust and general sketch-based monitoring in software switches. In ACM SIGCOMM. 334--350."},{"key":"e_1_3_2_2_22_1","unstructured":"Zaoxing Liu Antonis Manousis Gregory Vorsanger Vyas Sekar and Vladimir Braverman. 2016. One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. In ACM SIGCOMM. 101--114.  Zaoxing Liu Antonis Manousis Gregory Vorsanger Vyas Sekar and Vladimir Braverman. 2016. One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. In ACM SIGCOMM. 101--114."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976021.3"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781933019604"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Srinivas Narayana Anirudh Sivaraman Vikram Nathan Prateesh Goyal Venkat Arun Mohammad Alizadeh Vimalkumar Jeyakumar and Changhoon Kim. 2017. Language-Directed Hardware Design for Network Performance Monitoring. In ACM SIGCOMM. 85--98.  Srinivas Narayana Anirudh Sivaraman Vikram Nathan Prateesh Goyal Venkat Arun Mohammad Alizadeh Vimalkumar Jeyakumar and Changhoon Kim. 2017. Language-Directed Hardware Design for Network Performance Monitoring. In ACM SIGCOMM. 85--98.","DOI":"10.1145\/3098822.3098829"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2818716"},{"key":"e_1_3_2_2_28_1","volume-title":"Beginning Django","author":"Rubio Daniel","unstructured":"Daniel Rubio . 2017. Jinja templates in Django . In Beginning Django . Springer , 117--161. Daniel Rubio. 2017. Jinja templates in Django. In Beginning Django. Springer, 117--161."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3063772"},{"key":"e_1_3_2_2_30_1","volume-title":"Stanford Workshop on Buffer Sizing.","author":"Spang Bruce","year":"2019","unstructured":"Bruce Spang and Nick McKeown . 2019 . On estimating the number of flows . In Stanford Workshop on Buffer Sizing. Bruce Spang and Nick McKeown. 2019. On estimating the number of flows. In Stanford Workshop on Buffer Sizing."},{"key":"e_1_3_2_2_31_1","volume-title":"New Streaming Algorithms for Fast Detection of Superspreaders. In Network and Distributed System Security Symposium.","author":"Venkataraman Shobha","year":"2005","unstructured":"Shobha Venkataraman , Dawn Xiaodong Song , Phillip B. Gibbons , and Avrim Blum . 2005 . New Streaming Algorithms for Fast Detection of Superspreaders. In Network and Distributed System Security Symposium. Shobha Venkataraman, Dawn Xiaodong Song, Phillip B. Gibbons, and Avrim Blum. 2005. New Streaming Algorithms for Fast Detection of Superspreaders. In Network and Distributed System Security Symposium."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_2_33_1","unstructured":"Andrew Chi-Chih Yao. 1978. Should Tables Be Sorted? (Extended Abstract). In Foundations of Computer Science. 22--27.  Andrew Chi-Chih Yao. 1978. Should Tables Be Sorted? (Extended Abstract). In Foundations of Computer Science. 22--27."}],"event":{"name":"SIGCOMM '20: Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication","location":"Virtual Event USA","acronym":"SIGCOMM '20","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405865","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:35Z","timestamp":1750200095000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405865"}},"subtitle":["Answering Many Network Traffic Queries, One Memory Update at a Time"],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":32,"alternative-id":["10.1145\/3387514.3405865","10.1145\/3387514"],"URL":"https:\/\/doi.org\/10.1145\/3387514.3405865","relation":{},"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}