{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:11:41Z","timestamp":1742969501719,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319951737"},{"type":"electronic","value":"9783319951744"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95174-4_48","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T08:21:23Z","timestamp":1530606083000},"page":"627-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Mining of Correlated Heavy Hitters"],"prefix":"10.1007","author":[{"given":"Marco","family":"Pulimeno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Italo","family":"Epicoco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Cafaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catiuscia","family":"Melle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Aloisio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"48_CR1","unstructured":"Boyer, R., Moore, J.: MJRTY - a fast majority vote algorithm. Technical report 32, Institute for Computing Science, University of Texas, Austin (1981)"},{"key":"48_CR2","series-title":"Automated Reasoning Series","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-94-011-3488-0_5","volume-title":"Automated Reasoning: Essays in Honor of Woody Bledsoe","author":"R Boyer","year":"1991","unstructured":"Boyer, R., Moore, J.S.: MJRTY - a fast majority vote algorithm. In: Boyer, R.S. (ed.) Automated Reasoning: Essays in Honor of Woody Bledsoe. Automated Reasoning Series, pp. 105\u2013117. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"48_CR3","doi-asserted-by":"publisher","unstructured":"Cafaro, M., Epicoco, I., Aloisio, G., Pulimeno, M.: CUDA based parallel implementations of space-saving on a GPU. In: 2017 International Conference on High Performance Computing Simulation (HPCS), pp. 707\u2013714, July 2017. \n                      https:\/\/doi.org\/10.1109\/HPCS.2017.108","DOI":"10.1109\/HPCS.2017.108"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"24078","DOI":"10.1109\/ACCESS.2017.2757238","volume":"5","author":"M Cafaro","year":"2017","unstructured":"Cafaro, M., Epicoco, I., Pulimeno, M., Aloisio, G.: On frequency estimation and detection of frequent items in time faded streams. IEEE Access 5, 24078\u201324093 (2017). \n                      https:\/\/doi.org\/10.1109\/ACCESS.2017.2757238","journal-title":"IEEE Access"},{"key":"48_CR5","unstructured":"Cafaro, M., Pulimeno, M.: Merging frequent summaries. In: Proceedings of the 17th Italian Conference on Theoretical Computer Science (ICTCS 2016), vol. 1720. pp. 280\u2013285. CEUR Proceedings (2016)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.eswa.2017.11.021","volume":"96","author":"Massimo Cafaro","year":"2018","unstructured":"Cafaro, M., Pulimeno, M., Epicoco, I.: Parallel mining of time-faded heavy hitters. Expert Syst. Appl. 96, 115\u2013128 (2018). \n                      https:\/\/doi.org\/10.1016\/j.eswa.2017.11.021\n                      \n                    , \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417417307777","journal-title":"Expert Systems with Applications"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2016.07.077","volume":"370\u2013371","author":"M Cafaro","year":"2016","unstructured":"Cafaro, M., Pulimeno, M., Epicoco, I., Aloisio, G.: Mining frequent items in the time fading model. Inf. Sci. 370\u2013371, 221\u2013238 (2016). \n                      https:\/\/doi.org\/10.1016\/j.ins.2016.07.077","journal-title":"Inf. Sci."},{"issue":"7","key":"48_CR8","doi-asserted-by":"publisher","first-page":"e4160","DOI":"10.1002\/cpe.4160","volume":"30","author":"Massimo Cafaro","year":"2017","unstructured":"Cafaro, M., Pulimeno, M., Epicoco, I., Aloisio, G.: Parallel space saving on multi- and many-core processors. Concurr. Comput.: Pract. Exp. 30(7), e4160-n\/a (2017). \n                      https:\/\/doi.org\/10.1002\/cpe.4160","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2015.09.003","volume":"329","author":"Massimo Cafaro","year":"2016","unstructured":"Cafaro, M., Pulimeno, M., Tempesta, P.: A parallel space saving algorithm for frequent items and the hurwitz zeta distribution. Inf. Sci. 329, 1\u201319 (2016). \n                      https:\/\/doi.org\/10.1016\/j.ins.2015.09.003\n                      \n                    , \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S002002551500657X","journal-title":"Information Sciences"},{"issue":"15","key":"48_CR10","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1002\/cpe.1761","volume":"23","author":"M Cafaro","year":"2011","unstructured":"Cafaro, M., Tempesta, P.: Finding frequent items in parallel. Concurr. Comput.: Pract. Exp. 23(15), 1774\u20131788 (2011). \n                      https:\/\/doi.org\/10.1002\/cpe.1761","journal-title":"Concurr. Comput.: Pract. Exp."},{"key":"48_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 693\u2013703. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45465-9_59"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","volume":"257","author":"Ling Chen","year":"2014","unstructured":"Chen, L., Mei, Q.: Mining frequent items in data stream using time fading model. Inf. Sci. 257, 54\u201369 (2014). \n                      https:\/\/doi.org\/10.1016\/j.ins.2013.09.007\n                      \n                    , \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025513006403","journal-title":"Information Sciences"},{"issue":"1","key":"48_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1), 58\u201375 (2005). \n                      https:\/\/doi.org\/10.1016\/j.jalgor.2003.12.001","journal-title":"J. Algorithms"},{"issue":"1","key":"48_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249\u2013278 (2005). \n                      https:\/\/doi.org\/10.1145\/1061318.1061325","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"48_CR15","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 Abbadi, A.: Thread cooperation in multicore architectures for frequency counting over multiple data streams. Proc. VLDB Endow. 2(1), 217\u2013228 (2009). \n                      https:\/\/doi.org\/10.14778\/1687627.1687653","journal-title":"Proc. VLDB Endow."},{"key":"48_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms \u2014 ESA 2002","author":"ED Demaine","year":"2002","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348\u2013360. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45749-6_33"},{"issue":"1","key":"48_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s10618-017-0526-x","volume":"32","author":"I Epicoco","year":"2018","unstructured":"Epicoco, I., Cafaro, M., Pulimeno, M.: Fast and accurate mining of correlated heavy hitters. Data Min. Knowl. Discov. 32(1), 162\u2013186 (2018). \n                      https:\/\/doi.org\/10.1007\/s10618-017-0526-x","journal-title":"Data Min. Knowl. Discov."},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.procs.2012.04.010","volume":"9","author":"Ugo Erra","year":"2012","unstructured":"Erra, U., Frola, B.: Frequent items mining acceleration exploiting fast parallel sorting on the GPU. Proc. Comput. Sci. 9, 86\u201395 (2012). \n                      https:\/\/doi.org\/10.1016\/j.procs.2012.04.010\n                      \n                    , \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050912001317\n                      \n                    . Proceedings of the International Conference on Computational Science, ICCS 2012","journal-title":"Procedia Computer Science"},{"key":"48_CR19","doi-asserted-by":"publisher","unstructured":"Govindaraju, N.K., Raghuvanshi, N., Manocha, D.: Fast and approximate stream mining of quantiles and frequencies using graphics processors. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 611\u2013622. ACM (2005). \n                      https:\/\/doi.org\/10.1145\/1066157.1066227","DOI":"10.1145\/1066157.1066227"},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Jin, C., Qian, W., Sha, C., Yu, J.X., Zhou, A.: Dynamically maintaining frequent items over a data stream. In: Proceedings Of CIKM, pp. 287\u2013294. ACM Press (2003)","DOI":"10.1145\/956863.956918"},{"issue":"1","key":"48_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51\u201355 (2003). \n                      https:\/\/doi.org\/10.1145\/762471.762473","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"48_CR22","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s10618-015-0438-6","volume":"30","author":"B Lahiri","year":"2016","unstructured":"Lahiri, B., Mukherjee, A.P., Tirthapura, S.: Identifying correlated heavy-hitters in a two-dimensional data stream. Data Min. Knowl. Disc. 30(4), 797\u2013818 (2016). \n                      https:\/\/doi.org\/10.1007\/s10618-015-0438-6","journal-title":"Data Min. Knowl. Disc."},{"key":"48_CR23","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/B978-155860869-6\/50038-X","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Gurmeet Singh Manku","year":"2002","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: VLDB, pp. 346\u2013357 (2002)"},{"issue":"3","key":"48_CR24","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A Metwally","year":"2006","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst. 31(3), 1095\u20131133 (2006). \n                      https:\/\/doi.org\/10.1145\/1166074.1166084","journal-title":"ACM Trans. Database Syst."},{"issue":"2","key":"48_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Sci. Comput. Program. 2(2), 143\u2013152 (1982)","journal-title":"Sci. Comput. Program."},{"key":"48_CR26","doi-asserted-by":"publisher","unstructured":"Roy, P., Teubner, J., Alonso, G.: Efficient frequent item counting in multi-core hardware. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2012, pp. 1451\u20131459. ACM (2012). \n                      https:\/\/doi.org\/10.1145\/2339530.2339757","DOI":"10.1145\/2339530.2339757"},{"key":"48_CR27","doi-asserted-by":"publisher","unstructured":"Tangwongsan, K., Tirthapura, S., Wu, K.L.: Parallel streaming frequency-based aggregates. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2014, pp. 236\u2013245. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2612669.2612695","DOI":"10.1145\/2612669.2612695"},{"issue":"5","key":"48_CR28","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s11280-017-0433-5","volume":"20","author":"S Wu","year":"2017","unstructured":"Wu, S., Lin, H., Gao, Y., Lu, D.: Novel structures for counting frequent items in time decayed streams. World Wide Web 20(5), 1111\u20131133 (2017). \n                      https:\/\/doi.org\/10.1007\/s11280-017-0433-5","journal-title":"World Wide Web"},{"key":"48_CR29","doi-asserted-by":"publisher","unstructured":"Zhang, Y.: Parallelizing the weighted lossy counting algorithm in high-speed network monitoring. In: Second International Conference on Instrumentation, Measurement, Computer, Communication and Control (IMCCC), pp. 757\u2013761 (2012). \n                      https:\/\/doi.org\/10.1109\/IMCCC.2012.183","DOI":"10.1109\/IMCCC.2012.183"},{"issue":"18","key":"48_CR30","doi-asserted-by":"publisher","first-page":"2856","DOI":"10.1002\/cpe.3182","volume":"26","author":"Y Zhang","year":"2014","unstructured":"Zhang, Y., Sun, Y., Zhang, J., Xu, J., Wu, Y.: An efficient framework for parallel and continuous frequent item monitoring. Concurr. Comput.: Pract. Exp. 26(18), 2856\u20132879 (2014). \n                      https:\/\/doi.org\/10.1002\/cpe.3182","journal-title":"Concurr. Comput.: Pract. Exp."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95174-4_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T02:42:39Z","timestamp":1583203359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95174-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951737","9783319951744"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95174-4_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}