{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:39:02Z","timestamp":1649191142453},"reference-count":30,"publisher":"International Academy Publishing (IAP)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.7.7.1545-1554","type":"journal-article","created":{"date-parts":[[2012,7,29]],"date-time":"2012-07-29T15:15:31Z","timestamp":1343574931000},"source":"Crossref","is-referenced-by-count":3,"title":["A Fast and Efficient Algorithm for Finding Frequent Items over Data Stream"],"prefix":"10.17706","volume":"7","author":[{"given":"Ling","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2012,7,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"ref2","first-page":"348","article-title":"Frequency estimation of internet packet streams with limited space.","volume-title":"Proceeding of the 10th Annual European Symposium on Algorithms","author":"Demaine","year":"2002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2004.1311242"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/276304.276334","article-title":"New sampling-based summary statistics for improving approximate query answer","volume-title":"Proc. SIGMOD","author":"Gibbons","year":"1998"},{"key":"ref8","first-page":"484","article-title":"Error-adaptive and time-aware maintenance of frequency counts over data streams","volume-title":"Proceeding of WAIN","author":"Liu","year":"2006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"ref10","first-page":"296","article-title":"What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically.","volume-title":"Proc. of the 22nd ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems","author":"Cormode","year":"2003"},{"key":"ref11","first-page":"287","article-title":"Dynamically maintaining frequent items over a data stream.","volume-title":"Proc. of the 2003 ACM CIKM Int\u2019l Conf. on Information and Knowledge Management","author":"Jin","year":"2003"},{"key":"ref12","article-title":"Computing iceberg queries efficiently.","volume-title":"Proceedings of 24th International Conference on Very Large Data Bases (VLDB 1998)","author":"Fang","year":"1998"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2007.368918"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1145\/375663.375670","article-title":"Space-efficient online computation of quantile summaries.","volume-title":"Proc. SIGMOD","author":"Greenwald","year":"2001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1360\/jos180884"},{"key":"ref16","first-page":"286","article-title":"Approximate counts and quantiles over sliding windows.","volume-title":"Proceedings of the 23rd ACM Symposium on Principles of Database Systems","author":"Arasu","year":"2004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948227"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142393"},{"key":"ref19","article-title":"Frequency estimation over sliding windows","volume-title":"Proceedings of SIGKDD","author":"Zhang","year":"2007"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1145\/543613.543615","article-title":"Models and issues in data stream systems.","volume-title":"Proc. PODS","author":"Babcock","year":"2002"},{"key":"ref21","volume-title":"Data streams: Algorithms and applications. Technical Report","author":"Muthukrishnan","year":"2003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.07.011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.11.001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.07.006"},{"issue":"Issue 24","key":"ref25","first-page":"4958","article-title":"4Nuno Homem, Joao Paulo Carvalho, Finding top-k elements in data streams","volume":"180","year":"2010","journal-title":"Inf. Sci.","ISSN":"http:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-010-9020-z"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-70918-3_40","article-title":"A deterministic algorithm for summarizing asynchronous streams over sliding windows.","volume-title":"Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007)","author":"Busch","year":"2007"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/AICI.2009.369"},{"key":"ref29","first-page":"1530","article-title":"Finding frequent items in data streams","volume":"08","author":"Cormode","year":"2009","journal-title":"VLDB"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0267-2"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T04:10:02Z","timestamp":1562040602000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/7692"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,1]]},"references-count":30,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2012,7,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.7.7.1545-1554","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7,1]]}}}