{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:37:52Z","timestamp":1768981072424,"version":"3.49.0"},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1093\/comjnl\/bxv118","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T02:29:03Z","timestamp":1452133743000},"page":"1113-1128","source":"Crossref","is-referenced-by-count":13,"title":["Frequent Subgraph Mining Based on Pregel"],"prefix":"10.1093","volume":"59","author":[{"given":"Xiang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Ishikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiuyang","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"key":"2016083005472000000_59.8.1113.1","first-page":"340","article-title":"On graph query optimization in large networks","volume":"3","author":"Zhao","year":"2010","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.2","doi-asserted-by":"crossref","unstructured":"Han W.-S. , Lee J. and Lee J.-H. (2013) Turbo $_{\\mbox {iso}}$ : Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases. Proc. SIGMOD 13, New York, NY, USA, June 22\u201327, pp. 337\u2013348. ACM, New York, NY, USA.","DOI":"10.1145\/2463676.2465300"},{"key":"2016083005472000000_59.8.1113.3","first-page":"169","article-title":"A partition-based approach to structure similarity search","volume":"7","author":"Zhao","year":"2013","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.4","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0301-y"},{"key":"2016083005472000000_59.8.1113.5","first-page":"1978","article-title":"Simple, fast, and scalable reachability oracle","volume":"6","author":"Jin","year":"2013","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.6","doi-asserted-by":"crossref","unstructured":"Zhu A.D. , Xiao X. , Wang S. and Lin W. (2013) Efficient Single-Source Shortest Path and Distance Queries on Large Graphs. Proc. KDD 13, Chicago, IL, August 11\u201314, pp. 998\u20131006. ACM, New York, NY, USA.","DOI":"10.1145\/2487575.2487665"},{"key":"2016083005472000000_59.8.1113.7","doi-asserted-by":"crossref","unstructured":"Aggarwal C.C. and Wang H. (2010) Managing and Mining Graph Data (1st edn). Springer, New York, NY.","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"2016083005472000000_59.8.1113.8","unstructured":"Dean J. and Ghemawat S. (2004) MapReduce: Simplified Data Processing on Large Clusters. Proc. OSDI 04, San Francisco, CA, December 6\u20138, pp. 137\u2013150. USENIX Association, Berkeley, CA, USA."},{"key":"2016083005472000000_59.8.1113.9","first-page":"716","article-title":"Distributed GraphLab: a framework for machine learning in the cloud","volume":"5","author":"Low","year":"2012","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.10","doi-asserted-by":"crossref","unstructured":"Malewicz G. , Austern M.H. , Bik A.J.C. , Dehnert J.C. , Horn I. , Leiser N. and Czajkowski G. (2010) Pregel: A System for Large-Scale Graph Processing. Proc. SIGMOD 10, Indianapolis, IN, June 6\u201311, pp. 135\u2013146. ACM, New York, NY, USA.","DOI":"10.1145\/1807167.1807184"},{"key":"2016083005472000000_59.8.1113.11","doi-asserted-by":"crossref","unstructured":"Gao J. , Zhou C. , Zhou J. and Yu J.X. (2014) Continuous Pattern Detection Over Billion-Edge Graph Using Distributed Framework. Proc. ICDE 14, Chicago, IL, March 31\u2013April 4, pp. 556\u2013567. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"2016083005472000000_59.8.1113.12","doi-asserted-by":"crossref","unstructured":"Inokuchi A. , Washio T. and Motoda H. (2000) An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. Proc. PKDD 00, Lyon, France, September 13\u201316, pp. 13\u201323. Springer, Berlin.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"2016083005472000000_59.8.1113.13","doi-asserted-by":"crossref","unstructured":"Kuramochi M. and Karypis G. (2001) Frequent Subgraph Discovery. Proc. ICDM 01, San Jose, CA, November 29\u2013December 2, pp. 313\u2013320. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"2016083005472000000_59.8.1113.14","unstructured":"Yan X. and Han J. (2002) gSpan: Graph-based Substructure Pattern Mining. Proc. ICDM 02, Maebashi City, Japan, December 9\u201312, pp. 721\u2013724. IEEE, CS Washington, DC, USA."},{"key":"2016083005472000000_59.8.1113.15","doi-asserted-by":"crossref","unstructured":"Huan J. , Wang W. and Prins J. (2003) Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. Proc. ICDM 03, Melbourne, FL, November 19\u201322, pp. 549\u2013552. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"2016083005472000000_59.8.1113.16","doi-asserted-by":"crossref","unstructured":"Nijssen S. and Kok J.N. (2004) A Quickstart in Frequent Structure Mining Can Make a Difference. Proc. KDD 04, Seattle, WA, August 22\u201325, pp. 647\u2013652. ACM, New York, NY, USA.","DOI":"10.1145\/1014052.1014134"},{"key":"2016083005472000000_59.8.1113.17","doi-asserted-by":"crossref","unstructured":"Maunz A. , Helma C. and Kramer S. (2009) Large-Scale Graph Mining using Backbone Refinement Classes. Proc. KDD 09, Paris, France, June 28\u2013July 1, pp. 617\u2013626. ACM, New York, NY, USA.","DOI":"10.1145\/1557019.1557089"},{"key":"2016083005472000000_59.8.1113.18","doi-asserted-by":"crossref","unstructured":"Wang C. , Wang W. , Pei J. , Zhu Y. and Shi B. (2004) Scalable Mining of Large Disk-Based Graph Databases. Proc. KDD 04, Seattle, WA, August 22\u201325, pp. 316\u2013325. ACM, New York, NY, USA.","DOI":"10.1145\/1014052.1014088"},{"key":"2016083005472000000_59.8.1113.19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","article-title":"Substructure discovery using minimum description length and background knowledge","volume":"1","author":"Cook","year":"1994","journal-title":"J. Artif. Intell. Res."},{"key":"2016083005472000000_59.8.1113.20","doi-asserted-by":"crossref","unstructured":"Lin W. , Xiao X. and Ghinita G. (2014) Large-Scale Frequent Subgraph Mining in MapReduce. Proc. ICDE 14, Chicago, IL, March 31\u2013April 4, pp. 844\u2013855. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816705"},{"key":"2016083005472000000_59.8.1113.21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345408"},{"key":"2016083005472000000_59.8.1113.22","unstructured":"Aridhi S. (2013) Distributed frequent subgraph mining in the cloud. PhD Thesis, Blaise Pascal University Aubi\u00e8re, France."},{"key":"2016083005472000000_59.8.1113.23","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"2016083005472000000_59.8.1113.24","doi-asserted-by":"crossref","unstructured":"Reinhardt S.P. and Karypis G. (2007) A Multi-level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph. Proc. IPDPS 07, Long Beach, CA, March 26\u201330, pp. 1\u20138. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/IPDPS.2007.370404"},{"key":"2016083005472000000_59.8.1113.25","unstructured":"Fiedler M. and Borgelt C. (2007) Support Computation for Mining Frequent Subgraphs in a Single Graph. Proc. MLG 07, Firence, Italy, August 1\u20133. ACM, New York, NY, USA."},{"key":"2016083005472000000_59.8.1113.26","doi-asserted-by":"crossref","unstructured":"Bringmann B. and Nijssen S. (2008) What is Frequent in a Single Graph?. Proc. PAKDD 08, Osaka, Japan, May 20\u201323, pp. 858\u2013863. Springer, Berlin.","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"2016083005472000000_59.8.1113.27","first-page":"517","article-title":"GraMi: Frequent subgraph and pattern mining in a single large graph","volume":"7","author":"Elseidy","year":"2014","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.28","doi-asserted-by":"crossref","unstructured":"Kuramochi M. and Karypis G. (2004) GREW-A Scalable Frequent Subgraph Discovery Algorithm. Proc. ICDM 04, Brighton, UK, November 1\u20134, pp. 439\u2013442. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDM.2004.10024"},{"key":"2016083005472000000_59.8.1113.29","doi-asserted-by":"crossref","unstructured":"Chen C. , Yan X. , Zhu F. and Han J. (2007) gApprox: Mining Frequent Approximate Patterns from a Massive Network. Proc. ICDM 07, Omaha, NE, October 28\u201331, pp. 445\u2013450. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDM.2007.36"},{"key":"2016083005472000000_59.8.1113.30","doi-asserted-by":"crossref","unstructured":"Qin L. , Yu J.X. , Chang L. , Cheng H. , Zhang C. and Lin X. (2014) Scalable Big Graph Processing in MapReduce. Proc. SIGMOD 14, Snowbird, UT, June 22\u201327, pp. 827\u2013838. ACM, New York, NY, USA.","DOI":"10.1145\/2588555.2593661"},{"key":"2016083005472000000_59.8.1113.31","doi-asserted-by":"crossref","unstructured":"Bahmani B. , Chakrabarti K. and Xin D. (2011) Fast Personalized PageRank on MapReduce. Proc. SIGMOD 11, Athens, Greece, June 12\u201316, pp. 973\u2013984. ACM, New York, NY, USA.","DOI":"10.1145\/1989323.1989425"},{"key":"2016083005472000000_59.8.1113.32","doi-asserted-by":"crossref","unstructured":"Rastogi V. , Machanavajjhala A. , Chitnis L. and Sarma A.D. (2013) Finding Connected Components in Map-reduce in Logarithmic Rounds. Proc. ICDE 13, Brisbane, QLD, April 8\u201312, pp. 50\u201361. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2013.6544813"},{"key":"2016083005472000000_59.8.1113.33","doi-asserted-by":"crossref","unstructured":"Gao J. , Zhou J. , Zhou C. and Yu J.X. (2014) GLog: A High Level Graph Analysis System using Mapreduce. Proc. ICDE 14, Chicago, IL, March 31\u2013April 4, pp. 544\u2013555. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816680"},{"key":"2016083005472000000_59.8.1113.34","first-page":"193","article-title":"From \u2018think like a vertex\u2019 to \u2018think like a graph\u2019","volume":"7","author":"Tian","year":"2013","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.35","doi-asserted-by":"crossref","unstructured":"Shao B. , Wang H. and Li Y. (2013) Trinity: A Distributed Graph Engine on a Memory Cloud. Proc. SIGMOD 13, New York, NY, June 22\u201327, pp. 505\u2013516. ACM, New York, NY, USA.","DOI":"10.1145\/2463676.2467799"},{"key":"2016083005472000000_59.8.1113.36","doi-asserted-by":"crossref","unstructured":"Khayyat Z. , Awara K. , Alonazi A. , Jamjoom H. , Williams D. and Kalnis P. (2013) Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing. Proc. EuroSys 13, Prague, Czech, April 14\u201317, pp. 169\u2013182. ACM, New York, NY, USA.","DOI":"10.1145\/2465351.2465369"},{"key":"2016083005472000000_59.8.1113.37","first-page":"577","article-title":"Optimizing graph algorithms on pregel-like systems","volume":"7","author":"Salihoglu","year":"2014","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.38","first-page":"788","article-title":"Efficient subgraph matching on billion node graphs","volume":"5","author":"Sun","year":"2012","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.39","first-page":"61","article-title":"Toward a distance oracle for billion-node graphs","volume":"7","author":"Qi","year":"2013","journal-title":"PVLDB"},{"key":"2016083005472000000_59.8.1113.40","doi-asserted-by":"crossref","unstructured":"Wang L. , Xiao Y. , Shao B. and Wang H. (2014) How to Partition a Billion-node Graph. Proc. ICDE 14, Chicago, IL, March 31\u2013April 4, pp. 568\u2013579. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816682"},{"key":"2016083005472000000_59.8.1113.41","doi-asserted-by":"crossref","unstructured":"Yang S. , Yan X. , Zong B. and Khan A. (2012) Towards Effective Partition Management for Large Graphs. Proc. SIGMOD 12, Scottsdale, AZ, May 20\u201324, pp. 517\u2013528. ACM, New York, NY, USA.","DOI":"10.1145\/2213836.2213895"},{"key":"2016083005472000000_59.8.1113.42","doi-asserted-by":"crossref","unstructured":"Huang J. , Venkatraman K. and Abadi D.J. (2014) Query Optimization of Distributed Pattern Matching. Proc. ICDE 14, Chicago, IL, March 31\u2013April 4, pp. 64\u201375. IEEE, CS Washington, DC, USA.","DOI":"10.1109\/ICDE.2014.6816640"},{"key":"2016083005472000000_59.8.1113.43","doi-asserted-by":"crossref","unstructured":"Mondal J. and Deshpande A. (2012) Managing Large Dynamic Graphs Efficiently. Proc. SIGMOD 12, Scottsdale, AZ, May 20\u201324, pp. 145\u2013156. ACM, New York, NY, USA.","DOI":"10.1145\/2213836.2213854"},{"key":"2016083005472000000_59.8.1113.44","doi-asserted-by":"crossref","unstructured":"Leskovec J. and Faloutsos C. (2006) Sampling from Large Graphs. Proc. KDD 06, Philadelphia, PA, August 20\u201323, pp. 631\u2013636. ACM, New York, NY, USA.","DOI":"10.1145\/1150402.1150479"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/8\/1113\/8039116\/bxv118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T07:17:47Z","timestamp":1567495067000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxv118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,6]]},"references-count":44,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2016,8,30]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1093\/comjnl\/bxv118"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxv118","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,6]]}}}