{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T03:03:59Z","timestamp":1730343839330,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,21]]},"DOI":"10.23919\/ifipnetworking52078.2021.9472827","type":"proceedings-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T16:09:00Z","timestamp":1625846940000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Sketching with Traffic-Aware Summaries"],"prefix":"10.23919","author":[{"given":"Dor","family":"Harris","sequence":"first","affiliation":[]},{"given":"Arik","family":"Rinberg","sequence":"additional","affiliation":[]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882946"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737645"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3068604"},{"journal-title":"Apache DataSketches (Incubating)","year":"0","key":"ref30"},{"key":"ref37","article-title":"Optimizing cost and performance in online service provider networks","author":"zhang","year":"0","journal-title":"USENIX NSDI"},{"key":"ref36","article-title":"Software defined traffic measurement with OpenSketch","author":"yu","year":"0","journal-title":"USENIX NSDI"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3063772"},{"key":"ref10","article-title":"Comparing data streams using hamming norms","author":"datar","year":"0","journal-title":"International Conference on Very Large Databases (VLDB)"},{"year":"1996","author":"deutsch","key":"ref11"},{"year":"0","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"journal-title":"An Introduction to Probability Theory and Its Applications","year":"1957","author":"feller","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.46"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3185467.3185476"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3405669.3405820"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"ref28","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"0","journal-title":"International Conference on Database Theory"},{"key":"ref4","article-title":"Counting distinct elements in a data stream","author":"bar-yossef","year":"0","journal-title":"International Workshop on Randomization and Approximation Techniques in Computer Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131407"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/15326349708807412"},{"journal-title":"HyperLogLog in Presto A significantly faster way to handle cardinality estimation","year":"0","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592692"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1900000004","article-title":"Synopses for massive data: Samples, histograms, wavelets, sketches","volume":"4","author":"cormode","year":"2012","journal-title":"Foundations and Trends in Databases"},{"key":"ref7","article-title":"Sketch techniques for approximate query processing","author":"cormode","year":"2011","journal-title":"Foundations and Trends in Databases"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2018.02.018"},{"journal-title":"Hillview A Big Data Spreadsheet","year":"0","key":"ref20"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"huffman","year":"0","journal-title":"IEEE Proc IRE"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"ref25","article-title":"FlowRadar: A better NetFlow for data centers","author":"li","year":"0","journal-title":"USENIX NSDI"}],"event":{"name":"2021 IFIP Networking Conference (IFIP Networking)","start":{"date-parts":[[2021,6,21]]},"location":"Espoo and Helsinki, Finland","end":{"date-parts":[[2021,6,24]]}},"container-title":["2021 IFIP Networking Conference (IFIP Networking)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9472750\/9472195\/09472827.pdf?arnumber=9472827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T06:44:32Z","timestamp":1643265872000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9472827\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":38,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking52078.2021.9472827","relation":{},"subject":[],"published":{"date-parts":[[2021,6,21]]}}}