{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:18:12Z","timestamp":1740176292773,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multi-Scale Comp. Syst."],"published-print":{"date-parts":[[2018,7,1]]},"DOI":"10.1109\/tmscs.2017.2768426","type":"journal-article","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T18:39:50Z","timestamp":1509475190000},"page":"217-230","source":"Crossref","is-referenced-by-count":1,"title":["Finding and Counting Tree-Like Subgraphs Using MapReduce"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8886-8191","authenticated-orcid":false,"given":"Zhao","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2789-1291","authenticated-orcid":false,"given":"Langshi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4710-2525","authenticated-orcid":false,"given":"Mihai","family":"Avram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Butt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maleq","family":"Khan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1653-0658","authenticated-orcid":false,"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judy","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Vullikanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1118","article-title":"Towards scalable subgraph pattern matching over big graphs on MapReduce","author":"suo","year":"2016","journal-title":"Proc IEEE 22nd Int Conf Parallel Distrib Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.02.004"},{"key":"ref33","first-page":"18","article-title":"Towards hpc-abds: An initial high-performance big data stack","volume":"1","author":"qiu","year":"2014","journal-title":"Building Robust Big Data Ecosystem ISO\/IEC JTC 1 Study Group on Big Data"},{"key":"ref32","doi-asserted-by":"crossref","DOI":"10.1093\/bioinformatics\/btl301","article-title":"Biological network comparison using graphlet degree distribution","volume":"23","author":"pr\u017eulj","year":"2007","journal-title":"Bioinform"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"ref30","article-title":"Network motifs: Simple building blocks of complex networks","volume":"298","author":"milo","year":"2002","journal-title":"Sci"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.30"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00887-0_11"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516427"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021271615909"},{"key":"ref10","first-page":"2","article-title":"Subgraph counting: Color coding beyond trees","author":"chakaravarthy","year":"2016","journal-title":"Proc IEEE Int Parallel Distrib Process Symp"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963491"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2017.19"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/PL00012580"},{"key":"ref13","first-page":"130","article-title":"Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts","author":"curticapean","year":"2014","journal-title":"Proc IEEE 55th Annu Symp Found Comput Sci"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref15","first-page":"347","article-title":"Java thread and process performance for parallel machine learning on multicore HPC clusters","author":"ekanayake","year":"2016","journal-title":"Proc IEEE Int Conf Big Data"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427203"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.10.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117456"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"ref28","article-title":"Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)","author":"marx","year":"2014","journal-title":"Proc 31st Int Symp Theoretical Aspects Comput Sci"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"ref27","first-page":"341","article-title":"MapReduce-based pattern finding algorithm applied in motif detection for prescription compatibility network","author":"liu","year":"2009","journal-title":"Proc Int Conf Adv Parallel Process Technol"},{"key":"ref3","article-title":"Scalemine: Scalable parallel frequent subgraph mining in a single large graph","author":"abdelhamid","year":"2016","journal-title":"Proc Int Conf High Perform Comput Netw Storage Anal"},{"year":"2017","key":"ref6","article-title":"Elastic computing cloud (ec2)."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835822"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"ref8","first-page":"248","article-title":"Cosi: Cloud oriented subgraph identification in massive social networks","author":"br\u00f6cheler","year":"2010","journal-title":"Proc Int Conf Adv Social Netw Anal Mining"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2009.5429425"},{"year":"2017","key":"ref2"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/2093157.2093165","article-title":"Habanero-Java: The new adventures of old X10","author":"cav\u00e9","year":"2011","journal-title":"Proc 9th Int Conf Principles Practice Program Java"},{"year":"2017","key":"ref1"},{"key":"ref46","first-page":"594","article-title":"Subgraph enumeration in large social contact networks using parallel color coding and streaming","author":"zhao","year":"2010","journal-title":"Proc 39th Int Conf Parallel Process"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9008-7"},{"key":"ref45","first-page":"228","article-title":"Harp: Collective communication on Hadoop","author":"zhang","year":"2015","journal-title":"Proc IEEE Int'l Conf Cloud Eng"},{"key":"ref22","first-page":"13","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"inokuchi","year":"2000","journal-title":"Data Mining and Knowledge Discovery"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.44"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793304601"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557111"},{"key":"ref23","first-page":"653","article-title":"Limits and applications of group algebras for parameterized problems","author":"koutis","year":"2009","journal-title":"Proc Int Colloquium Autom Languages Program"},{"key":"ref44","first-page":"324","article-title":"Mining closed relational graphs with connectivity constraints","author":"yan","year":"2005","journal-title":"Proc 11th ACM SIGKDD Int Conf Knowl Discovery Data Mining"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/11731139_44","article-title":"Patterns of influence in a recommendation network","author":"leskovec","year":"2006","journal-title":"Proc ACM Int Conf Knowledge Discovery and Data Mining"},{"journal-title":"Hadoop The Definitive Guide","year":"2010","author":"white","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"}],"container-title":["IEEE Transactions on Multi-Scale Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687315\/8466693\/08090537.pdf?arnumber=8090537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T20:30:32Z","timestamp":1693168232000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8090537\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,1]]},"references-count":47,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tmscs.2017.2768426","relation":{},"ISSN":["2332-7766","2372-207X"],"issn-type":[{"type":"electronic","value":"2332-7766"},{"type":"electronic","value":"2372-207X"}],"subject":[],"published":{"date-parts":[[2018,7,1]]}}}