{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:29Z","timestamp":1750306109529,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,23]],"date-time":"2017-04-23T00:00:00Z","timestamp":1492905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,23]]},"DOI":"10.1145\/3064176.3064190","type":"proceedings-article","created":{"date-parts":[[2017,4,17]],"date-time":"2017-04-17T12:27:04Z","timestamp":1492432024000},"page":"513-526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["High-Throughput Subset Matching on Commodity GPU-Based Systems"],"prefix":"10.1145","author":[{"given":"Daniele","family":"Rogora","sequence":"first","affiliation":[{"name":"USI, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Papalini","sequence":"additional","affiliation":[{"name":"Cisco Systems, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koorosh","family":"Khazaei","sequence":"additional","affiliation":[{"name":"USI, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Margara","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Carzaniga","sequence":"additional","affiliation":[{"name":"USI, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Cugola","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,4,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2012.6231276"},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"Knowledge and Information Systems","author":"Bouros P.","year":"2015","unstructured":"P. Bouros , N. Mamoulis , S. Ge , and M. Terrovitis . Set containment join revisited . Knowledge and Information Systems , pages 1 -- 28 , 2015 . P. Bouros, N. Mamoulis, S. Ge, and M. Terrovitis. Set containment join revisited. Knowledge and Information Systems, pages 1--28, 2015."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276336"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1619258.1619269"},{"key":"e_1_3_2_1_5_1","first-page":"386","volume-title":"Proceedings of the International Conference on Very Large Data Bases, VLDB '97","author":"Helmer S.","year":"1997","unstructured":"S. Helmer and G. Moerkotte . Evaluation of main memory join algorithms for joins with set comparison join predicates . In Proceedings of the International Conference on Very Large Data Bases, VLDB '97 , pages 386 -- 395 , 1997 . S. Helmer and G. Moerkotte. Evaluation of main memory join algorithms for joins with set comparison join predicates. In Proceedings of the International Conference on Very Large Data Bases, VLDB '97, pages 386--395, 1997."},{"key":"e_1_3_2_1_6_1","volume-title":"ICWSM","author":"Hong L.","year":"2011","unstructured":"L. Hong , G. Convertino , and E. H. Chi . Language matters in twitter: A large scale study . In ICWSM , 2011 . L. Hong, G. Convertino, and E. H. Chi. Language matters in twitter: A large scale study. In ICWSM, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11408079_69"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872778"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.39"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762474"},{"key":"e_1_3_2_1_13_1","first-page":"284","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining, KDD '98","author":"Morzy T.","year":"1998","unstructured":"T. Morzy and M. Zakrzewicz . Group bitmap index: A structure for association rules retrieval . In Proceedings of the International Conference on Knowledge Discovery and Data Mining, KDD '98 , pages 284 -- 288 , 1998 . T. Morzy and M. Zakrzewicz. Group bitmap index: A structure for association rules retrieval. In Proceedings of the International Conference on Knowledge Discovery and Data Mining, KDD '98, pages 284--288, 1998."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660129.2660155"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2881025.2881032"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2658260.2658267"},{"key":"e_1_3_2_1_17_1","first-page":"351","volume-title":"Proceedings of the International Conference on Very Large Data Bases, VLDB '00","author":"Ramasamy K.","year":"2000","unstructured":"K. Ramasamy , J. M. Patel , J. F. Naughton , and R. Kaushik . Set containment joins: The good, the bad and the ugly . In Proceedings of the International Conference on Very Large Data Bases, VLDB '00 , pages 351 -- 362 , 2000 . K. Ramasamy, J. M. Patel, J. F. Naughton, and R. Kaushik. Set containment joins: The good, the bad and the ugly. In Proceedings of the International Conference on Very Large Data Bases, VLDB '00, pages 351--362, 2000."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882089"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205003"},{"key":"e_1_3_2_1_20_1","volume-title":"Many-Core and Reconfigurable Supercomputing Conference, MRSC '10","author":"Tsoi K. H.","year":"2010","unstructured":"K. H. Tsoi , I. Papagiannis , M. Migliavacca , W. Luk , and P. Pietzuch . Accelerating publish\/subscribe matching on reconfigurable supercomputing platforms . In Many-Core and Reconfigurable Supercomputing Conference, MRSC '10 , 2010 . K. H. Tsoi, I. Papagiannis, M. Migliavacca, W. Luk, and P. Pietzuch. Accelerating publish\/subscribe matching on reconfigurable supercomputing platforms. In Many-Core and Reconfigurable Supercomputing Conference, MRSC '10, 2010."},{"key":"e_1_3_2_1_21_1","first-page":"199","volume-title":"Proceedings of the USENIX Conference on Networked Systems Design and Implementation, NSDI '13","author":"Wang Y.","year":"2013","unstructured":"Y. Wang , Y. Zu , T. Zhang , K. Peng , Q. Dong , B. Liu , W. Meng , H. Dai , X. Tian , Z. Xu , H. Wu , and D. Yang . Wire speed name lookup: A gpu-based approach . In Proceedings of the USENIX Conference on Networked Systems Design and Implementation, NSDI '13 , pages 199 -- 212 , 2013 . Y. Wang, Y. Zu, T. Zhang, K. Peng, Q. Dong, B. Liu, W. Meng, H. Dai, X. Tian, Z. Xu, H. Wu, and D. Yang. Wire speed name lookup: A gpu-based approach. In Proceedings of the USENIX Conference on Networked Systems Design and Implementation, NSDI '13, pages 199--212, 2013."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2014.6914320"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/176567.176573"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ANCS.2015.7110125"}],"event":{"name":"EuroSys '17: Twelfth EuroSys Conference 2017","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Belgrade Serbia","acronym":"EuroSys '17"},"container-title":["Proceedings of the Twelfth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3064176.3064190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3064176.3064190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:15Z","timestamp":1750217775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3064176.3064190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,23]]},"references-count":24,"alternative-id":["10.1145\/3064176.3064190","10.1145\/3064176"],"URL":"https:\/\/doi.org\/10.1145\/3064176.3064190","relation":{},"subject":[],"published":{"date-parts":[[2017,4,23]]},"assertion":[{"value":"2017-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}