{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T06:38:17Z","timestamp":1723531097019},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/infocom.2017.8057088","type":"proceedings-article","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T16:28:21Z","timestamp":1507220901000},"source":"Crossref","is-referenced-by-count":31,"title":["Better with fewer bits: Improving the performance of cardinality estimation of large data streams"],"prefix":"10.1109","author":[{"given":"Qingjun","family":"Xiao","sequence":"first","affiliation":[]},{"given":"You","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005709"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140295"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461921"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061958"},{"key":"ref14","author":"lu","year":"2016","journal-title":"Better with fewer bits Improving the performance of cardinality estimation of large data streams (extended version online)"},{"key":"ref15","author":"lu","year":"2016","journal-title":"Source code and tester code of HLL-TaiICut+ algorithm"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353418"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1340771.1340773"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.44"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061990"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247504"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"ref7","article-title":"HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm","author":"flajolet","year":"2007","journal-title":"Proc of AOFA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45726-7_1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1317331.1317335"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061956"},{"key":"ref21","article-title":"Software defined traffic measurement with OpenSketch","author":"yu","year":"2013","journal-title":"Proc of USENIX NSDI"}],"event":{"name":"IEEE INFOCOM 2017 - IEEE Conference on Computer Communications","location":"Atlanta, GA, USA","start":{"date-parts":[[2017,5,1]]},"end":{"date-parts":[[2017,5,4]]}},"container-title":["IEEE INFOCOM 2017 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8049192\/8056940\/08057088.pdf?arnumber=8057088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T23:32:49Z","timestamp":1509147169000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8057088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infocom.2017.8057088","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}
