{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:15:00Z","timestamp":1761581700274,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,19]],"date-time":"2018-05-19T00:00:00Z","timestamp":1526688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Chinese Academy of Science","award":["XDA06010306","CXJJ-16M119"],"award-info":[{"award-number":["XDA06010306","CXJJ-16M119"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61303241"],"award-info":[{"award-number":["61303241"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11036-018-1051-x","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T23:23:28Z","timestamp":1526685808000},"page":"1732-1741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Identification of TOP-K Heavy Hitters over Sliding Windows"],"prefix":"10.1007","volume":"24","author":[{"given":"Haina","family":"Tang","sequence":"first","affiliation":[]},{"given":"Yulei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chunjing","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jingguo","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Xiangpeng","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,19]]},"reference":[{"key":"1051_CR1","doi-asserted-by":"crossref","unstructured":"Zhao Q, Kumar A, Xu J (2005) Joint data streaming and sampling techniques for detection of super sources and destinations. Proc 5th ACM SIGCOMM Conf Internet Measure: 7\u20137","DOI":"10.1145\/1330107.1330117"},{"key":"1051_CR2","doi-asserted-by":"crossref","unstructured":"Kompella R, Singh S, Varghese G (2004) On scalable attack detection in the network. Proc 4th ACM SIGCOMM Conf Internet Measure: 187\u2013200","DOI":"10.1145\/1028788.1028812"},{"key":"1051_CR3","unstructured":"Akamai (2016) Akamai Q1 2016 State of the Internet Security Report [Online]. \nhttps:\/\/content.akamai.com\/PG6292-SOTI-Security.html"},{"key":"1051_CR4","doi-asserted-by":"crossref","unstructured":"Shapsough S, Qatan F, Aburukba R, Aloul F, Ali A (2015) Smart grid cyber security: challenges and solutions. Int Conf Smart Grid Clean Energy Technol (ICSGCE): 170\u2013175","DOI":"10.1109\/ICSGCE.2015.7454291"},{"issue":"1","key":"1051_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TSG.2014.2343997","volume":"6","author":"Y Yao","year":"2014","unstructured":"Yao Y, Xiong S, Qi H, Liu Y, Tolbert L, Cao Q (2014) Efficient histogram estimation for smart grid data processing with the Loglog-bloom-filter. IEEE Trans Smart Grid 6(1):199\u2013208","journal-title":"IEEE Trans Smart Grid"},{"key":"1051_CR6","doi-asserted-by":"crossref","unstructured":"Procopiou A, Komninos N (2015) Current and future threats framework in smart grid domain. IEEE Int Conf Cyber Technol Auto Contrl Intell Syst(CYBER): 1852\u20131857","DOI":"10.1109\/CYBER.2015.7288228"},{"issue":"24","key":"1051_CR7","doi-asserted-by":"publisher","first-page":"4958","DOI":"10.1016\/j.ins.2010.08.024","volume":"180","author":"N Homem","year":"2010","unstructured":"Homem N, Carvalho J (December 2010) Finding top- k elements in data streams. Inf Sci 180(24):4958\u20134974","journal-title":"Inf Sci"},{"key":"1051_CR8","first-page":"229","volume":"1999","author":"M Roesch","year":"1999","unstructured":"Roesch M (1999) Snort\u2013lightweight intrusion detection for networks. Proc USENIX LISA 1999:229\u2013238","journal-title":"Proc USENIX LISA"},{"key":"1051_CR9","first-page":"305","volume":"2000","author":"D Plonka","year":"2000","unstructured":"Plonka D (2000) FlowScan: a network traffic flow reporting and visualization tool. Proc USENIX LISA 2000:305\u2013317","journal-title":"Proc USENIX LISA"},{"key":"1051_CR10","doi-asserted-by":"crossref","unstructured":"Estan C, Varghese G, Fiskin M (2003) Bitmap algorithms for counting active flows on high speed links. Proc 3rd ACM SIGCOMM Conf Internet Measure: 153\u2013166","DOI":"10.1145\/948205.948225"},{"key":"1051_CR11","first-page":"156","volume":"2011","author":"P Wang","year":"2011","unstructured":"Wang P, Guan X, Gong W, Towsley D (2011) A new virtual indexing method for measuring host connection degrees. INFOCOM 2011:156\u2013160","journal-title":"INFOCOM"},{"key":"1051_CR12","unstructured":"S. Venkataraman, D. Song, P. Gibbons, and A. Blum, (2005) New streaming algorithms for fast detection of Superspreaders. Proc Netwk Distributed Syst Security Sym (NDSS): 149\u2013166"},{"key":"1051_CR13","doi-asserted-by":"crossref","unstructured":"Bandi N, Agrawal D, El A (2007) Fast Algorithms for heavy distinct hitters using associative memories. Int Conf Distrib Comput Syst: 6\u20136","DOI":"10.1109\/ICDCS.2007.110"},{"issue":"1","key":"1051_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1341431.1341433","volume":"38","author":"X Dimitropoulos","year":"2008","unstructured":"Dimitropoulos X, Hurley P, Kind A (January 2008) Probabilistic lossy counting: an efficient algorithm for finding heavy hitters. ACM SIGCOMM Comput Commun Rev 38(1):5\u20135","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"issue":"1","key":"1051_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R Karp","year":"2003","unstructured":"Karp R, Shenker S, Papadimitriou C (March 2003) A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS) 28(1):51\u201355","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"1051_CR16","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-30570-5_27","volume-title":"Database Theory - ICDT 2005","author":"Ahmed Metwally","year":"2004","unstructured":"Metwally A, Agrawal D, El A (2005) Efficient computation of frequent and top-k elements in data streams. Int Conf Database Theory. Springer Berlin Heidelberg: 398\u2013412"},{"key":"1051_CR17","doi-asserted-by":"crossref","unstructured":"M. Charikar, K. Chen, and M. Farach-Colton, (2002) Finding frequent items in data streams. International colloquium on automata, languages, and programming. Springer berlin Heidelberg, pp. 693\u2013703","DOI":"10.1007\/3-540-45465-9_59"},{"issue":"1","key":"1051_CR18","first-page":"1","volume":"29","author":"G Cormode","year":"2014","unstructured":"Cormode G (November 2014) Count-min sketch. Encyclopedia Algorithms Springer US 29(1):1\u20136","journal-title":"Encyclopedia Algorithms Springer US"},{"key":"1051_CR19","doi-asserted-by":"crossref","unstructured":"Huang Q, Lee P (2014) LD-sketch: a distributed sketching design for accurate and scalable anomaly detection in network data streams. Int Conf Comput Commun: 1420\u20131428","DOI":"10.1109\/INFOCOM.2014.6848076"},{"key":"1051_CR20","doi-asserted-by":"crossref","unstructured":"Anceaume E, Busnel Y, Rivetti N (2015) Estimating the frequency of data items in massive distributed streams. IEEE Sym Netwrk Cloud Comput Appl (NCCA): 59\u201366","DOI":"10.1109\/NCCA.2015.19"},{"key":"1051_CR21","doi-asserted-by":"crossref","unstructured":"Roy P, Khan A, Alonso G (2016) Augmented sketch: faster and more accurate stream processing. Proc 2016 Int Conf Manag Data: 1449\u20131463","DOI":"10.1145\/2882903.2882948"},{"key":"1051_CR22","doi-asserted-by":"crossref","unstructured":"Pitel G, Fouquier G (2015) Count-min-log sketch: approximately counting with approximate counters. 1st Int Sym Web Algorithms","DOI":"10.1007\/978-3-642-27848-8_579-1"},{"key":"1051_CR23","first-page":"1","volume":"2016","author":"R Ben-Basat","year":"2016","unstructured":"Ben-Basat R, Einziger G, Friedman R, Kassner Y (2016) Heavy hitters in streams and sliding windows. IEEE INFOCOM 2016:1\u20139","journal-title":"IEEE INFOCOM"},{"key":"1051_CR24","doi-asserted-by":"crossref","unstructured":"Roy P, Teubner J, Alonso G (2012) Efficient frequent item counting in multi-core hardware. Proc 18th ACM SIGKDD Int Conf Knowledge Discov Data Mining: 1451\u20131459","DOI":"10.1145\/2339530.2339757"},{"issue":"1","key":"1051_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.14778\/1687627.1687653","volume":"2","author":"S Das","year":"2009","unstructured":"Das S, Antony S, Agrawal D, El A (2009) Thread cooperation in multicore architectures for frequency counting over multiple data streams. Proc VLDB Endowment 2(1):217\u2013228","journal-title":"Proc VLDB Endowment"},{"key":"1051_CR26","doi-asserted-by":"crossref","unstructured":"Einziger G, Friedman R (2016) Counting with TinyTable: every bit counts!. Proc Int Conf Distrib Comput Network (ICDCN 2016), Article No 27","DOI":"10.1145\/2833312.2833449"},{"issue":"1","key":"1051_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s12530-010-9020-z","volume":"2","author":"N Homem","year":"2011","unstructured":"Homem N, Carvalho J (2011) Finding top-k elements in a time-sliding window. Evol Syst 2(1):51\u201370","journal-title":"Evol Syst"},{"key":"1051_CR28","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.comcom.2014.12.003","volume":"61","author":"Z Zhang","year":"2015","unstructured":"Zhang Z, Wang B, Lan J (2015) Identifying elephant flows in internet backbone traffic with bloom filters and LRU. Comput Commun 61:70\u201378","journal-title":"Comput Commun"},{"key":"1051_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2016.07.077","volume":"370","author":"M Cafaro","year":"2016","unstructured":"Cafaro M, Pulimeno M, Epicoco I, Aloisio G (2016) Mining frequent items in the time fading model. Inf Sci 370:221\u2013238","journal-title":"Inf Sci"},{"issue":"1","key":"1051_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00778-009-0172-z","volume":"19","author":"G Cormode","year":"2010","unstructured":"Cormode G, Hadjieleftheriou M (2010) Methods for finding frequent items in data streams. VLDB J 19(1):3\u201320","journal-title":"VLDB J"},{"issue":"2","key":"1051_CR31","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/1454159.1454225","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode G, Hadjieleftheriou M (2008) Finding frequent items in data streams. Proc VLDB Endowment 1(2):1530\u20131541","journal-title":"Proc VLDB Endowment"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-018-1051-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,7]],"date-time":"2020-03-07T06:11:06Z","timestamp":1583561466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-018-1051-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,19]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1051"],"URL":"https:\/\/doi.org\/10.1007\/s11036-018-1051-x","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2018,5,19]]},"assertion":[{"value":"19 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}