{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:33:19Z","timestamp":1755999199219,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T00:00:00Z","timestamp":1591574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Israel Cyber Directorate"},{"DOI":"10.13039\/100015089","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2364"],"award-info":[{"award-number":["N00014-18-1-2364"]}],"id":[{"id":"10.13039\/100015089","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israeli Science Foundation","award":["1505\/16"],"award-info":[{"award-number":["1505\/16"]}]},{"name":"Intel Labs University Research Office"},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["Lifelong Learning Machines program"],"award-info":[{"award-number":["Lifelong Learning Machines program"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Zuckerman Foundation"},{"name":"the Technion Hiroshi Fujiwara Cyber Security Research Center"},{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1813487, CNS-1700521, CNS-1565343, CAREER-1652257"],"award-info":[{"award-number":["1813487, CNS-1700521, CNS-1565343, CAREER-1652257"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Cyber Security Research Center and the Lynne and William Frankel Center for Computing Science at Ben-Gurion University"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,8]]},"DOI":"10.1145\/3393691.3394193","type":"proceedings-article","created":{"date-parts":[[2020,6,8]],"date-time":"2020-06-08T22:04:07Z","timestamp":1591653847000},"page":"61-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["I Know What You Did Last Summer"],"prefix":"10.1145","author":[{"given":"Nikita","family":"Ivkin","sequence":"first","affiliation":[{"name":"Amazon, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran Ben","family":"Basat","sequence":"additional","affiliation":[{"name":"Harvard University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaoxing","family":"Liu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Einziger","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Negev, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy","family":"Friedman","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Braverman","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"The CAIDA nonymized Internet Traces equinix-nyc 2018-03--15 Dir. A.  The CAIDA nonymized Internet Traces equinix-nyc 2018-03--15 Dir. A."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485882"},{"key":"e_1_3_2_2_3_1","volume-title":"CoNEXT","author":"Basat R. B.","year":"2018","unstructured":"Basat , R. B. , Einziger , G. , Keslassy , I. , Orda , A. , Vargaftik , S. , and Waisbard , E . Memento: Making sliding windows efficient for heavy hitters . In CoNEXT 2018 . Basat, R. B., Einziger, G., Keslassy, I., Orda, A., Vargaftik, S., and Waisbard, E. Memento: Making sliding windows efficient for heavy hitters. In CoNEXT 2018."},{"key":"e_1_3_2_2_4_1","volume-title":"PVLDB","author":"Basat R. B.","year":"2019","unstructured":"Basat , R. B. , Friedman , R. , and Shahout , R . Heavy hitters over interval queries . In PVLDB ( 2019 ). Also available on arXiv:1804.10740. Basat, R. B., Friedman, R., and Shahout, R. Heavy hitters over interval queries. In PVLDB (2019). Also available on arXiv:1804.10740."},{"key":"e_1_3_2_2_5_1","unstructured":"Braverman V. Chestnut S. R. Ivkin N. Nelson J. Wang Z. and Woodruff D. P. Bptree: an $ell_2 $ heavy hitters algorithm using constant memory. arXiv:1603.00759.  Braverman V. Chestnut S. R. Ivkin N. Nelson J. Wang Z. and Woodruff D. P. Bptree: an $ell_2 $ heavy hitters algorithm using constant memory. arXiv:1603.00759."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366709"},{"key":"e_1_3_2_2_7_1","volume-title":"ACM CoNEXT","author":"Ivkin N.","year":"2019","unstructured":"Ivkin , N. , Yu , Z. , Braverman , V. , and Jin , X . Qpipe: Quantiles sketch fully in the data plane . In ACM CoNEXT ( 2019 ). Ivkin, N., Yu, Z., Braverman, V., and Jin, X. Qpipe: Quantiles sketch fully in the data plane. In ACM CoNEXT (2019)."},{"key":"e_1_3_2_2_8_1","volume-title":"ACM SIGCOMM","author":"Liu Z.","year":"2019","unstructured":"Liu , Z. , Ben-Basat , R. , Einziger , G. , Kassner , Y. , Braverman , V. , Friedman , R. , and Sekar , V . Nitrosketch: Robust and general sketch-based monitoring in software switches . In ACM SIGCOMM ( 2019 ). Liu, Z., Ben-Basat, R., Einziger, G., Kassner, Y., Braverman, V., Friedman, R., and Sekar, V. Nitrosketch: Robust and general sketch-based monitoring in software switches. In ACM SIGCOMM (2019)."},{"key":"e_1_3_2_2_9_1","volume-title":"ACM SIGCOMM","author":"Liu Z.","year":"2016","unstructured":"Liu , Z. , Manousis , A. , Vorsanger , G. , Sekar , V. , and Braverman , V . One sketch to rule them all: Rethinking network flow monitoring with univmon . In ACM SIGCOMM ( 2016 ). Liu, Z., Manousis, A., Vorsanger, G., Sekar, V., and Braverman, V. One sketch to rule them all: Rethinking network flow monitoring with univmon. In ACM SIGCOMM (2016)."}],"event":{"name":"SIGMETRICS '20: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"],"location":"Boston MA USA","acronym":"SIGMETRICS '20"},"container-title":["Abstracts of the 2020 SIGMETRICS\/Performance Joint International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3393691.3394193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3393691.3394193","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3393691.3394193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:17Z","timestamp":1750200077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3393691.3394193"}},"subtitle":["Network Monitoring using Interval Queries"],"short-title":[],"issued":{"date-parts":[[2020,6,8]]},"references-count":9,"alternative-id":["10.1145\/3393691.3394193","10.1145\/3393691"],"URL":"https:\/\/doi.org\/10.1145\/3393691.3394193","relation":{},"subject":[],"published":{"date-parts":[[2020,6,8]]},"assertion":[{"value":"2020-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}