{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:45:14Z","timestamp":1762868714062,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,5]]},"DOI":"10.1109\/iscc53001.2021.9631495","type":"proceedings-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T20:46:50Z","timestamp":1639601210000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Apriori-Roaring-Parallel: Frequent pattern mining based on compressed bitmaps with OpenMP"],"prefix":"10.1109","author":[{"given":"Alexandre","family":"Colombo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberta","family":"Spolon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renata Spolon","family":"Lobato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleardo","family":"Manacero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos Antonio","family":"Cavenaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968012"},{"key":"ref11","first-page":"441","article-title":"H-mine: hyper-structure mining of frequent patterns in large databases","author":"pei","year":"2001","journal-title":"Proceedings 2001 IEEE International Conference on Data Mining"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49257-7_25"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.03.041"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-6520-0_11"},{"key":"ref16","article-title":"Sorting improves word-aligned bitmap indexes","volume":"abs 901 3751","author":"lemire","year":"2009","journal-title":"CoRR"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.05.018"},{"key":"ref18","first-page":"242","author":"pieterse","year":"2010","journal-title":"Performance of c++ bit-vector implementations"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33495-6_10"},{"journal-title":"Quest ibm synthetic data generator","year":"0","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810114"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064007"},{"journal-title":"FIMI '04 Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations","year":"2004","author":"bayardo","key":"ref27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref5","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proceedings of the International Conference on Very Large Data Bases VLDB"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"journal-title":"Information Retrieval Implementing and Evaluating Search Engines","year":"2010","author":"b\u00fcttcher","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2402"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276336"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2908446.2908457"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1565694.1565702"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.51"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-57489-4_59"},{"key":"ref23","article-title":"Faster population counts using AVX2 instructions","volume":"abs 1611 7612","author":"mula","year":"2016","journal-title":"CoRR"},{"key":"ref26","first-page":"90","article-title":"Efficient implementations of apriori and eclat","author":"borgelt","year":"2003","journal-title":"Proc 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations (FIMI 2003 Melbourne FL) CEUR Workshop Proceedings 90"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133907"}],"event":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2021,9,5]]},"location":"Athens, Greece","end":{"date-parts":[[2021,9,8]]}},"container-title":["2021 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9631377\/9631248\/09631495.pdf?arnumber=9631495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:54:24Z","timestamp":1652201664000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9631495\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,5]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/iscc53001.2021.9631495","relation":{},"subject":[],"published":{"date-parts":[[2021,9,5]]}}}