{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:11:46Z","timestamp":1767183106611,"version":"3.37.3"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872382,61521003"],"award-info":[{"award-number":["61872382,61521003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1109\/icccn54977.2022.9868882","type":"proceedings-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:26:54Z","timestamp":1662409614000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["LUSketch: A Fast and Precise Sketch for top-k Finding in Data Streams"],"prefix":"10.1109","author":[{"given":"Jie","family":"Lu","sequence":"first","affiliation":[{"name":"PLA Information Engineering University,Zheng Zhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchang","family":"Chen","sequence":"additional","affiliation":[{"name":"National Digital Switching System Engineering and Technological Research and Development Center,Zheng Zhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Network Communication and Security, Purple Mountain Laboratory,Nanjing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"journal-title":"BurstSketch Finding Bursts in Data Streams BurstSketch Finding Bursts in Data Streams","year":"2021","author":"zhong","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2805600"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403208"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2192447"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367508"},{"key":"ref15","first-page":"398","article-title":"SpaceSaving: Efficient Computation of Frequent and Top-k Elements in Data Streams","author":"metwally","year":"2005","journal-title":"Proceedings of the 10th International Conference on Database Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3115\/1603899.1603924"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.104987"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230570"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/510726.510749"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3365609.3365860"},{"key":"ref3","article-title":"New estimation algorithms for streaming data: Count-min can do more","author":"deng","year":"2007","journal-title":"Webdocs Cs Ualberta Ca"},{"key":"ref6","first-page":"180","article-title":"The war between mice and elephants","author":"guo","year":"2001","journal-title":"International Conference on Network Protocols"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2018.8549549"},{"key":"ref5","first-page":"909","article-title":"HeavyKeeper: An accurate algorithm for finding top-k elephant flows","author":"gong","year":"2018","journal-title":"Proceedings of the 2018 USENIX Annual Technical Conference USENIX ATC 2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3373360.3380841"},{"journal-title":"Hash website","year":"0","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108563"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"journal-title":"Source code related to LUSketch","year":"0","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219975"},{"journal-title":"The caida anonymized internet traces 2016","year":"0","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2822275"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-016-0022-0"},{"key":"ref26","first-page":"1885","article-title":"Robust aggregation algorithm in sensor networks","volume":"20","author":"wu","year":"2009","journal-title":"Ruan Jian Xue Bao\/Journal of Software"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3077902"}],"event":{"name":"2022 International Conference on Computer Communications and Networks (ICCCN)","start":{"date-parts":[[2022,7,25]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2022,7,28]]}},"container-title":["2022 International Conference on Computer Communications and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9868842\/9868856\/09868882.pdf?arnumber=9868882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T21:04:20Z","timestamp":1664226260000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9868882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icccn54977.2022.9868882","relation":{},"subject":[],"published":{"date-parts":[[2022,7]]}}}