{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T11:28:38Z","timestamp":1766748518199,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T00:00:00Z","timestamp":1487635200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE140100999","DP120104168"],"award-info":[{"award-number":["DE140100999","DP120104168"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DE150100563"],"award-info":[{"award-number":["DE150100563"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61232006"],"award-info":[{"award-number":["61232006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00778-017-0459-4","type":"journal-article","created":{"date-parts":[[2017,2,21]],"date-time":"2017-02-21T11:25:07Z","timestamp":1487676307000},"page":"421-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Scalable subgraph enumeration in MapReduce: a cost-oriented approach"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5443-4435","authenticated-orcid":false,"given":"Longbin","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"459_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: Proceedings of the ICDE\u201913 (2013)","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"459_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N., Willke, T.L.: Graphlet Decomposition: Framework, Algorithms, and Applications. ArXiv e-prints (2015)","DOI":"10.1007\/s10115-016-0965-5"},{"key":"459_CR3","doi-asserted-by":"crossref","unstructured":"Aiello, W., Chung, F., Lu, L.: A random graph model for massive graphs. In: Proceedings of the STOC\u201900 (2000)","DOI":"10.1145\/335305.335326"},{"key":"459_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Dao, P., Hajirasouliha, I., Hormozdiari, F., Sahinalp, S.C.: Biomolecular network motif counting and discovery by color coding. In: Proceedings of the ISMB\u201908 (2008)","DOI":"10.1093\/bioinformatics\/btn163"},{"issue":"3","key":"459_CR5","first-page":"608","volume":"27","author":"MA Bhuiyan","year":"2015","unstructured":"Bhuiyan, M.A., Hasan, M.A.: An iterative mapreduce based frequent subgraph mining algorithm. TKDE 27(3), 608\u2013620 (2015)","journal-title":"TKDE"},{"issue":"7","key":"459_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"1","key":"459_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"459_CR8","first-page":"6313","volume":"1","author":"FRK Chung","year":"2003","unstructured":"Chung, F.R.K., Lu, L., Vu, V.H.: The spectra of random graphs with given expected degrees. Internet Math. 1(3), 6313\u20136318 (2003)","journal-title":"Internet Math."},{"issue":"4","key":"459_CR9","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"key":"459_CR10","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: Proceedings of the OSDI\u201904 (2004)"},{"issue":"4","key":"459_CR11","first-page":"343","volume":"38","author":"P Erdos","year":"1960","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 38(4), 343\u2013347 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"1","key":"459_CR12","first-page":"264","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB 3(1), 264\u2013275 (2010)","journal-title":"PVLDB"},{"key":"459_CR13","doi-asserted-by":"crossref","unstructured":"Gonen, M., Ron, D., Shavitt, Y.: Counting stars and other small subgraphs in sublinear time. In: Proceedings of the SODA\u201910 (2010)","DOI":"10.1137\/1.9781611973075.10"},{"key":"459_CR14","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In: Proceedings of the RECOMB\u201907 (2007)"},{"key":"459_CR15","unstructured":"Gonzalez, J., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the OSDI\u201912 (2012)"},{"key":"459_CR16","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, J., Lee, J.H.: Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the SIGMOD\u201913 (2013)","DOI":"10.1145\/2463676.2465300"},{"key":"459_CR17","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the SIGMOD\u201908 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"459_CR18","doi-asserted-by":"crossref","unstructured":"Kairam, S.R., Wang, D.J., Leskovec, J.: The life and death of online groups: predicting group growth and longevity. In: Proceedings of the WSDM\u201912 (2012)","DOI":"10.1145\/2124295.2124374"},{"issue":"3","key":"459_CR19","first-page":"181","volume":"6","author":"A Khan","year":"2013","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., Yan, X.: Nema: Fast graph search with label similarity. PVLDB 6(3), 181\u2013190 (2013)","journal-title":"PVLDB"},{"key":"459_CR20","doi-asserted-by":"crossref","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. Proc. VLDB Endow. 8(10), 974\u2013985 (2015)","DOI":"10.14778\/2794367.2794368"},{"issue":"2","key":"459_CR21","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.S., Kasperovics, R., Lee, J.H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"key":"459_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Proceedings of the PAKDD\u201906 (2006)","DOI":"10.1007\/11731139_44"},{"key":"459_CR23","doi-asserted-by":"crossref","unstructured":"Lin, W., Xiao, X., Gabriel, G.: Large-scale frequent subgraph mining in mapreduce. In: ICDE, pp. 844\u2013855 (2014)","DOI":"10.1109\/ICDE.2014.6816705"},{"key":"459_CR24","doi-asserted-by":"crossref","unstructured":"Ma, S., Cao, Y., Huai, J., Wo, T.: Distributed graph pattern matching. In: WWW (2012)","DOI":"10.1145\/2187836.2187963"},{"key":"459_CR25","first-page":"257","volume":"6","author":"T Milenkovic","year":"2008","unstructured":"Milenkovic, T., Przulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Inf. 6, 257\u2013273 (2008)","journal-title":"Cancer Inf."},{"issue":"5594","key":"459_CR26","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"2","key":"459_CR27","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jpdc.2012.10.005","volume":"73","author":"T Plantenga","year":"2013","unstructured":"Plantenga, T.: Inexact subgraph isomorphism in mapreduce. J. Parallel Distrib. Comput. 73(2), 164\u2013175 (2013)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"459_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Przulj","year":"2007","unstructured":"Przulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), 177\u2013183 (2007)","journal-title":"Bioinformatics"},{"issue":"10","key":"459_CR29","first-page":"2466","volume":"26","author":"M Rahman","year":"2014","unstructured":"Rahman, M., Bhuiyan, M.A., Hasan, M.A.: Graft: an efficient graphlet counting method for large graph analysis. TKDE 26(10), 2466\u20132478 (2014)","journal-title":"TKDE"},{"issue":"5","key":"459_CR30","doi-asserted-by":"publisher","first-page":"617","DOI":"10.14778\/2735479.2735493","volume":"8","author":"X Ren","year":"2015","unstructured":"Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc. VLDB Endow. 8(5), 617\u2013628 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"459_CR31","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1021\/ci0100548","volume":"41","author":"G R\u00fccker","year":"2001","unstructured":"R\u00fccker, G., R\u00fccker, C.: Substructure, subgraph, and walk counts as measures of the complexity of graphs and molecules. J. Chem. Info. Comput. Sci. 41(6), 1457\u20131462 (2001)","journal-title":"J. Chem. Info. Comput. Sci."},{"key":"459_CR32","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., Borgwardt, K.: Efficient graphlet kernels for large graph comparison. In: AISTATS (2009)"},{"issue":"1","key":"459_CR33","first-page":"364","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB 1(1), 364\u2013375 (2008)","journal-title":"PVLDB"},{"key":"459_CR34","unstructured":"Steinbrunn, M., Moerkotte, G., Kemper, A.: Optimizing Join Orders. Tech. rep. (1993)"},{"issue":"9","key":"459_CR35","first-page":"788","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. PVLDB 5(9), 788\u2013789 (2012)","journal-title":"PVLDB"},{"key":"459_CR36","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proceedings of the WWW\u201911 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"459_CR37","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E., Kang, U., Miller, G.L., Faloutsos, C.: Doulion: Counting triangles in massive graphs with a coin. In: Proceedings of the KDD\u201909 (2009)","DOI":"10.1145\/1557019.1557111"},{"key":"459_CR38","doi-asserted-by":"crossref","unstructured":"Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: COCOON\u201905, pp. 440\u2013449 (2005)","DOI":"10.1007\/11533719_45"},{"issue":"9","key":"459_CR39","first-page":"812","volume":"5","author":"J Wang","year":"2012","unstructured":"Wang, J., Cheng, J.: Truss decomposition in massive networks. PVLDB 5(9), 812\u2013823 (2012)","journal-title":"Truss decomposition in massive networks. PVLDB"},{"issue":"393","key":"459_CR40","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"6684","author":"D Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2019small-world\u2019 networks. Nature 6684(393), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"1\u20132","key":"459_CR41","first-page":"340","volume":"3","author":"P Zhao","year":"2010","unstructured":"Zhao, P., Han, J.: On graph query optimization in large networks. PVLDB 3(1\u20132), 340\u2013451 (2010)","journal-title":"PVLDB"},{"key":"459_CR42","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Khan, M., Kumar, V.S.A., Marathe, M.V.: Subgraph enumeration in large social contact networks using parallel color coding and streaming. In: Proceedings of the ICPP\u201910 (2010)","DOI":"10.1109\/ICPP.2010.67"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0459-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-017-0459-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-017-0459-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T15:31:54Z","timestamp":1589643114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-017-0459-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,21]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s00778-017-0459-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2017,2,21]]},"assertion":[{"value":"4 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}