{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:04Z","timestamp":1774949704130,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/infocom41043.2020.9155454","type":"proceedings-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T18:29:35Z","timestamp":1596565775000},"page":"974-983","source":"Crossref","is-referenced-by-count":24,"title":["Universal Online Sketch for Tracking Heavy Hitters and Estimating Moments of Data Streams"],"prefix":"10.1109","author":[{"given":"Qingjun","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiying","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Pay for a sliding bloom filter and get counting, distinct elements, and entropy for free","author":"assaf","year":"2017","journal-title":"Proc of IEEE INFOCOM"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.249"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737531"},{"key":"ref16","article-title":"The caida anonymized internet traces","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2015.2423675"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028814"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005709"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098832"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"ref7","article-title":"Software defined traffic measurement with OpenSketch","author":"yu","year":"2013","journal-title":"Proc of NSDI"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485804"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140295"},{"key":"ref1","article-title":"Per-flow traffic measurement through randomized counter sharing","volume":"20","author":"tao","year":"2012","journal-title":"IEEE\/ACM ToN"},{"key":"ref20","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"Proc of ICDT"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2621159"},{"key":"ref21","first-page":"561","article-title":"Elastic sketch : Adaptive and fast network-wide measurements","author":"jiang","year":"2018","journal-title":"Proc of ACM SIGCOMM"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375472"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934972"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247510"}],"event":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications","location":"Toronto, ON, Canada","start":{"date-parts":[[2020,7,6]]},"end":{"date-parts":[[2020,7,9]]}},"container-title":["IEEE INFOCOM 2020 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9146503\/9155217\/09155454.pdf?arnumber=9155454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T17:50:44Z","timestamp":1656438644000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9155454\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/infocom41043.2020.9155454","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}