{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T11:55:05Z","timestamp":1776772505078,"version":"3.51.2"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"am","delay-in-days":606,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"FAPEMIG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1016\/j.jpdc.2024.104903","type":"journal-article","created":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T15:56:21Z","timestamp":1713801381000},"page":"104903","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["DuMato: An efficient warp-centric subgraph enumeration system for GPU"],"prefix":"10.1016","volume":"191","author":[{"given":"Samuel","family":"Ferraz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinicius","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos H.C.","family":"Teixeira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Teodoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Wagner","family":"Meira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jpdc.2024.104903_br0210","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"61:1","article-title":"Scalemine: scalable parallel frequent subgraph mining in a single large graph","author":"Abdelhamid","year":"2016"},{"key":"10.1016\/j.jpdc.2024.104903_br0290","series-title":"Proceedings of the 36th ACM International Conference on Supercomputing","article-title":"Parallel k-clique counting on gpus","author":"Almasri","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0150","series-title":"SIGMOD '16","first-page":"1199","article-title":"Efficient subgraph matching by postponing cartesian products","author":"Bi","year":"2016"},{"key":"10.1016\/j.jpdc.2024.104903_br0040","series-title":"Advances in Knowledge Discovery and Data Mining","first-page":"858","article-title":"What is frequent in a single graph?","author":"Bringmann","year":"2008"},{"key":"10.1016\/j.jpdc.2024.104903_br0300","series-title":"Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006)","first-page":"97","article-title":"Adaptive parallel graph mining for CMP architectures","author":"Buehrer","year":"2006"},{"key":"10.1016\/j.jpdc.2024.104903_br0320","series-title":"Proceedings of the 22nd Annual International Conference on Supercomputing","first-page":"26","article-title":"Data mining on the cell broadband engine","author":"Buehrer","year":"2008"},{"key":"10.1016\/j.jpdc.2024.104903_br0120","series-title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","first-page":"857","article-title":"Arvind, efficient and scalable graph pattern mining on GPUs","author":"Chen","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0330","series-title":"Proceedings of the Thirteenth EuroSys Conference","article-title":"An efficient task-oriented graph mining system","author":"Chen","year":"2018"},{"key":"10.1016\/j.jpdc.2024.104903_br0110","doi-asserted-by":"crossref","DOI":"10.14778\/3389133.3389137","article-title":"Pangolin: an efficient and flexible graph mining system on cpu and gpu","author":"Chen","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.jpdc.2024.104903_br0520","author":"Corporation"},{"key":"10.1016\/j.jpdc.2024.104903_br0200","series-title":"Proceedings of the 2018 World Wide Web Conference","first-page":"589","article-title":"Listing k-cliques in sparse real-world graphs*","author":"Danisch","year":"2018"},{"key":"10.1016\/j.jpdc.2024.104903_br0460","series-title":"WWW '18","article-title":"Listing k-cliques in sparse real-world graphs","author":"Danisch","year":"2018"},{"key":"10.1016\/j.jpdc.2024.104903_br0060","series-title":"SIGMOD '19","article-title":"Fractal: a general-purpose graph pattern mining system","author":"Dias","year":"2019"},{"key":"10.1016\/j.jpdc.2024.104903_br0430","series-title":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","article-title":"PARSEC: PARallel subgraph enumeration in CUDA","author":"Dodeja","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0030","series-title":"SACI '14","article-title":"A network motif based approach for classifying online social networks","author":"Duma","year":"2014"},{"key":"10.1016\/j.jpdc.2024.104903_br0490","doi-asserted-by":"crossref","DOI":"10.14778\/2732286.2732289","article-title":"Grami: frequent subgraph and pattern mining in a single large graph","author":"Elseidy","year":"2014","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.jpdc.2024.104903_br0240","doi-asserted-by":"crossref","DOI":"10.1145\/2543629","article-title":"Listing all maximal cliques in large sparse real-world graphs","volume":"18","author":"Eppstein","year":"2013","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.1016\/j.jpdc.2024.104903_br0170","series-title":"2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)","first-page":"110","article-title":"Efficient strategies for graph pattern mining algorithms on gpus","author":"Ferraz","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0400","series-title":"PACT '21","first-page":"318","article-title":"Sumpa: efficient pattern-centric graph mining with pattern abstraction","author":"Gui","year":"2021"},{"key":"10.1016\/j.jpdc.2024.104903_br0410","series-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","first-page":"1067","article-title":"Gpu-accelerated subgraph enumeration on partitioned graphs","author":"Guo","year":"2020"},{"issue":"09","key":"10.1016\/j.jpdc.2024.104903_br0140","doi-asserted-by":"crossref","first-page":"4231","DOI":"10.1109\/TKDE.2020.3035564","article-title":"Exploiting reuse for gpu subgraph enumeration","volume":"34","author":"Guo","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.jpdc.2024.104903_br0450","series-title":"SIGMOD","article-title":"Gpu-accelerated subgraph enumeration on partitioned graphs","author":"Guo","year":"2020"},{"key":"10.1016\/j.jpdc.2024.104903_br0160","series-title":"Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data","first-page":"337","article-title":"Towards ultrafast and robust subgraph isomorphism search in large graph databases","author":"Han","year":"2013"},{"key":"10.1016\/j.jpdc.2024.104903_br0480","series-title":"PPoPP '11","article-title":"Accelerating cuda graph algorithms at maximum warp","author":"Hong","year":"2011"},{"key":"10.1016\/j.jpdc.2024.104903_br0470","series-title":"AAAI '20","article-title":"Telltail: fast scoring and detection of dense subgraphs","author":"Hooi","year":"2020"},{"key":"10.1016\/j.jpdc.2024.104903_br0280","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis","article-title":"Tricore: parallel triangle counting on gpus","author":"Hu","year":"2018"},{"key":"10.1016\/j.jpdc.2024.104903_br0070","series-title":"EuroSys '20","article-title":"Peregrine: a pattern-aware graph mining system","author":"Jamshidi","year":"2020"},{"key":"10.1016\/j.jpdc.2024.104903_br0420","series-title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","article-title":"Vsgm: view-based gpu-accelerated subgraph matching on large graphs","author":"Jiang","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0190","series-title":"Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics","first-page":"135","article-title":"Engineering an efficient canonical labeling tool for large and sparse graphs","author":"Junttila","year":"2007"},{"key":"10.1016\/j.jpdc.2024.104903_br0250","series-title":"Proceedings of the 3rd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications","first-page":"1","article-title":"Parallel graph mining with gpus","volume":"vol. 36","author":"Kessl","year":"2014"},{"key":"10.1016\/j.jpdc.2024.104903_br0370","series-title":"SIGMOD '16","first-page":"1231","article-title":"Dualsim: parallel subgraph enumeration in a massive graph on a single machine","author":"Kim","year":"2016"},{"issue":"3","key":"10.1016\/j.jpdc.2024.104903_br0220","doi-asserted-by":"crossref","first-page":"217","DOI":"10.14778\/3021924.3021937","article-title":"Scalable distributed subgraph enumeration","volume":"10","author":"Lai","year":"2016","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.jpdc.2024.104903_br0500","doi-asserted-by":"crossref","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: densification and shrinking diameters","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.jpdc.2024.104903_br0260","series-title":"ICDE '15","article-title":"Network motif discovery: a gpu approach","author":"Lin","year":"2015"},{"key":"10.1016\/j.jpdc.2024.104903_br0440","series-title":"ECMLPKDD '08","article-title":"Effective pruning techniques for mining quasi-cliques","author":"Liu","year":"2008"},{"issue":"04","key":"10.1016\/j.jpdc.2024.104903_br0010","article-title":"Community detection in complex networks via clique conductance","volume":"8","author":"Lu","year":"2018","journal-title":"Sci. Rep."},{"key":"10.1016\/j.jpdc.2024.104903_br0090","series-title":"SOSP '19","article-title":"Automine: harmonizing high-level abstraction and high performance for graph mining","author":"Mawhirter","year":"2019"},{"key":"10.1016\/j.jpdc.2024.104903_br0390","doi-asserted-by":"crossref","DOI":"10.1145\/3469379.3469383","article-title":"Graphzero: a high-performance subgraph matching system","author":"Mawhirter","year":"2021","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"10.1016\/j.jpdc.2024.104903_br0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.jsc.2013.09.003","article-title":"Practical graph isomorphism, ii","author":"McKay","year":"2014","journal-title":"J. Symb. Comput."},{"issue":"2","key":"10.1016\/j.jpdc.2024.104903_br0230","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10618-013-0303-4","article-title":"G-tries: a data structure for storing and finding subgraphs","volume":"28","author":"Ribeiro","year":"2014","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.jpdc.2024.104903_br0050","series-title":"AAAI","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015"},{"key":"10.1016\/j.jpdc.2024.104903_br0380","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","article-title":"High performance graph pattern matching through effective redundancy elimination","author":"Shi","year":"2020"},{"key":"10.1016\/j.jpdc.2024.104903_br0020","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pbio.0020369","article-title":"Motifs in brain networks","author":"Sporns","year":"2004","journal-title":"PLoS Biol."},{"key":"10.1016\/j.jpdc.2024.104903_br0360","series-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE)","article-title":"Efficient parallel subgraph enumeration on a single machine","author":"Sun","year":"2019"},{"key":"10.1016\/j.jpdc.2024.104903_br0080","series-title":"SOSP '15","article-title":"Arabesque: a system for distributed graph mining","author":"Teixeira","year":"2015"},{"key":"10.1016\/j.jpdc.2024.104903_br0270","series-title":"Database Systems for Advanced Applications","first-page":"299","article-title":"Fast subgraph matching on large graphs using graphics processors","author":"Tran","year":"2015"},{"key":"10.1016\/j.jpdc.2024.104903_br0100","series-title":"OSDI'18","article-title":"Rstream: marrying relational algebra with streaming for efficient graph mining on a single machine","author":"Wang","year":"2018"},{"key":"10.1016\/j.jpdc.2024.104903_br0130","series-title":"SC22: International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"1","article-title":"Stmatch: accelerating graph pattern matching on gpu with stack-based loop optimizations","author":"Wei","year":"2022"},{"key":"10.1016\/j.jpdc.2024.104903_br0340","series-title":"2020 IEEE 36th International Conference on Data Engineering (ICDE)","first-page":"1369","article-title":"G-thinker: a distributed framework for mining subgraphs in a big graph","author":"Yan","year":"2020"},{"key":"10.1016\/j.jpdc.2024.104903_br0510","series-title":"MDS '12","article-title":"Defining and evaluating network communities based on ground-truth","author":"Yang","year":"2012"},{"issue":"4","key":"10.1016\/j.jpdc.2024.104903_br0310","doi-asserted-by":"crossref","first-page":"231","DOI":"10.14778\/1938545.1938548","article-title":"Fast sparse matrix-vector multiplication on gpus: implications for graph mining","volume":"4","author":"Yang","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.jpdc.2024.104903_br0350","series-title":"ICDE '20","first-page":"673","article-title":"Kaleido: an efficient out-of-core graph mining system on a single machine","author":"Zhao","year":"2020"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731524000674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731524000674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T07:59:49Z","timestamp":1717833589000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731524000674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":52,"alternative-id":["S0743731524000674"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2024.104903","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2024,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DuMato: An efficient warp-centric subgraph enumeration system for GPU","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2024.104903","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104903"}}