{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:17:43Z","timestamp":1740169063116,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61671078","61701031"],"award-info":[{"award-number":["61671078","61701031"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Director Funds of the Beijing Key Laboratory of Network System Architecture and Convergence","award":["2017BKL-NSAC-ZJ-06"],"award-info":[{"award-number":["2017BKL-NSAC-ZJ-06"]}]},{"name":"111 Project of China","award":["B08004","B17007"],"award-info":[{"award-number":["B08004","B17007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2865745","type":"journal-article","created":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T18:39:19Z","timestamp":1534444759000},"page":"45886-45898","source":"Crossref","is-referenced-by-count":0,"title":["A Cloud-Based Parallel Space-Saving Algorithm for Big Networking Data"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1895-0122","authenticated-orcid":false,"given":"Dazhong","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4007-6109","authenticated-orcid":false,"given":"Jun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6863129"},{"journal-title":"MJRTY—A Fast Majority Vote Algorithm","year":"1981","author":"boyer","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"ref13","first-page":"348","article-title":"Frequency estimation of Internet packet streams with limited space","author":"demaine","year":"2002","journal-title":"Proc 10th Ann European Symp Algorithms"},{"key":"ref14","first-page":"398","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"Proc Int Conf Database Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref16","first-page":"693","article-title":"Finding frequent items in data streams","author":"charikar","year":"2002","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"journal-title":"Frequent Items in Streaming Data An Experimental Evaluation of the State-of-the-art","year":"2009","author":"manerikar","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2757238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2012.155"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2013.6423193"},{"key":"ref3","first-page":"2","article-title":"Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing","author":"zaharia","year":"2012","journal-title":"Proc 9th USENIX Conf Netw Syst Des Implement"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2603511"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/s13677-016-0066-8"},{"key":"ref8","first-page":"8","article-title":"Comparing apache spark and map reduce with performance analysis using K-means","volume":"113","author":"gopalani","year":"2015","journal-title":"Int J Comput Appl"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2546544"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2013.0319"},{"key":"ref9","first-page":"3928","article-title":"Large-scale text processing pipeline with Apache Spark","author":"svyatkovskiy","year":"2016","journal-title":"Proc IEEE Int Conf Big Data"},{"key":"ref1","first-page":"1","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"Proc 2nd USENIX Conf Hot Topics Cloud Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-017-0433-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612695"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213562"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2008.4689258"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.09.003"},{"journal-title":"Mining heavy hitters with space-saving","year":"2013","author":"d\u2019elia","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.01.001"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08438445.pdf?arnumber=8438445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T11:55:37Z","timestamp":1643198137000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8438445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2865745","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}