{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:37:26Z","timestamp":1770741446436,"version":"3.49.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030790240","type":"print"},{"value":"9783030790257","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79025-7_1","type":"book-chapter","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T23:07:48Z","timestamp":1624403268000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Approximation of the Top-k Items in Data Streams Using a Reconfigurable Accelerator"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7477-504X","authenticated-orcid":false,"given":"Ali","family":"Ebrahim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0842-7426","authenticated-orcid":false,"given":"Jalal","family":"Khalifat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,23]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends\u00ae Theor. Comput. Sci. 2(1), 117\u2013236 (2005)","DOI":"10.1561\/0400000002"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/1454159.1454225","volume":"2","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. VLDB Endow. 2(1), 1530\u20131541 (2008)","journal-title":"VLDB Endow."},{"issue":"68","key":"1_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"4","author":"N Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 4(68), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"1_CR4","unstructured":"Biookaghazadeh, S., Zhao, M., Ren, F.: Are FPGAs suitable for edge computing? In: {USENIX} Workshop on Hot Topics in Edge Computing (HotEdge 2018) (2018)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"7823","DOI":"10.1109\/ACCESS.2018.2890150","volume":"7","author":"A Shawahna","year":"2018","unstructured":"Shawahna, A., Sait, S.M., El-Maleh, A.: FPGA-based accelerators of deep learning networks for learning and classification: a review. IEEE Access 7, 7823\u20137859 (2018)","journal-title":"IEEE Access"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: European Symposium on Algorithms, pp. 348\u2013360 (2002)","DOI":"10.1007\/3-540-45749-6_33"},{"key":"1_CR7","unstructured":"Kung, H., Leiserson, C.E.: Systolic arrays (for VLSI). In: Sparse Matrix, pp. 256\u2013282 (1979)"},{"key":"1_CR8","unstructured":"Baker, Z.K., Prasanna, V.K.: Efficient hardware data mining with the Apriori algorithm on FPGAs. In: 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2005), pp. 3\u201312 (2005)"},{"issue":"10","key":"1_CR9","first-page":"1","volume":"3","author":"A Prost-Boucle","year":"2017","unstructured":"Prost-Boucle, A., P\u00e9trot, F., Leroy, V., Alemdar, H.: Efficient and versatile FPGA acceleration of support counting for stream mining of sequences and frequent itemsets. ACM Trans. Reconfigurable Technol. Syst. (TRETS) 3(10), 1\u201325 (2017)","journal-title":"ACM Trans. Reconfigurable Technol. Syst. (TRETS)"},{"issue":"22","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/TPDS.2011.34","volume":"9","author":"S Sun","year":"2011","unstructured":"Sun, S., Zambreno, J.: Design and analysis of a reconfigurable platform for frequent pattern mining. IEEE Trans. Parallel Distrib. Syst. 9(22), 1497\u20131505 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"23","key":"1_CR11","first-page":"1169","volume":"8","author":"J Teubner","year":"2010","unstructured":"Teubner, J., Muller, R., Alonso, G.: Frequent item computation on a chip. IEEE Trans. Knowl. Data Eng. 8(23), 1169\u20131181 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient computation of frequent and top-k elements in data streams. In: International Conference on Database Theory, pp. 398\u2013412 (2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Sun, Y., et al.: Accelerating frequent item counting with FPGA. In: 2014 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, pp. 109\u2013112 (2014)","DOI":"10.1145\/2554688.2554766"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ebrahim, A., Khlaifat, J.: An efficient hardware architecture for finding frequent items in data streams. In: 2020 IEEE 38th International Conference on Computer Design (ICCD), pp. 113\u2013119 (2020)","DOI":"10.1109\/ICCD50377.2020.00034"},{"issue":"29","key":"1_CR15","first-page":"929","volume":"4","author":"D Tong","year":"2017","unstructured":"Tong, D., Prasanna, V.K.: Sketch acceleration on FPGA and its applications in network anomaly detection. IEEE Trans. Parallel Distrib. Syst. 4(29), 929\u2013942 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"55","key":"1_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"1","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 1(55), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Tong, D., Prasanna, V.: Online heavy hitter detector on FPGA. In: 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig), pp. 1\u20136 (2013)","DOI":"10.1109\/ReConFig.2013.6732297"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Zazo, J.F., Lopez-Buedo, S., Ruiz, M., Sutter, G.: A single-FPGA architecture for detecting heavy hitters in 100 gbit\/s ethernet links. In: 2017 International Conference on ReConFigurable Computing and FPGAs (ReConFig), pp. 1\u20136 (2017)","DOI":"10.1109\/RECONFIG.2017.8279770"},{"key":"1_CR19","unstructured":"Intel Arria 10 Device Overview. https:\/\/www.intel.com\/content\/dam\/www\/programmable\/us\/en\/pdfs\/literature\/hb\/arria-10\/a10_overview.pdf. Accessed 26 Jan 2021"},{"key":"1_CR20","unstructured":"Zipf, G.K.: Human behavior and the principle of least effort (1949)"},{"key":"1_CR21","doi-asserted-by":"crossref","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 (2017)","DOI":"10.1109\/HPCS.2017.108"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.procs.2012.04.010","volume":"9","author":"U Erra","year":"2012","unstructured":"Erra, U., Frola, B.: Frequent items mining acceleration exploiting fast parallel sorting on the GPU. Procedia Comput. Sci. 9, 86\u201395 (2012)","journal-title":"Procedia Comput. Sci."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: a case study. In: Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 254\u2013260 (1999)","DOI":"10.1145\/312129.312241"},{"key":"1_CR24","unstructured":"Frequent itemset mining dataset repository, University of Helsinki. http:\/\/fimi.cs.helsinki.fi\/data\/. Accessed 26 Jan 2021"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-46131-1_8","volume-title":"machine learning and knowledge discovery in databases","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., Bringmann, B., Fromont, \u00c9., Garriga, G., Miettinen, P., Tatti, N., Tresp, V. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36\u201340. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8"}],"container-title":["Lecture Notes in Computer Science","Applied Reconfigurable Computing. Architectures, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79025-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T23:10:10Z","timestamp":1624403410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79025-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030790240","9783030790257"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79025-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ARC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Applied Reconfigurable Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"arc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/project.inria.fr\/arc2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}