{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:09:50Z","timestamp":1751688590027,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319914510"},{"type":"electronic","value":"9783319914527"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-91452-7_57","type":"book-chapter","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T06:43:19Z","timestamp":1526107399000},"page":"891-907","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient and Scalable Mining of Frequent Subgraphs Using Distributed Graph Processing Systems"],"prefix":"10.1007","author":[{"given":"Tongtong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,13]]},"reference":[{"key":"57_CR1","unstructured":"National library of medicine. http:\/\/chem.sis.nlm.nih.gov\/chemidplus"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235\u2013242 (2000)","journal-title":"Nucleic Acids Res."},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Local feature view clustering for 3D object recognition. In: CVPR, pp. 682\u2013688 (2001)","DOI":"10.1109\/CVPR.2001.990541"},{"issue":"3","key":"57_CR4","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1109\/69.599932","volume":"9","author":"EGM Petrakis","year":"1997","unstructured":"Petrakis, E.G.M., Faloutsos, C.: Similarity searching in medical image databases. IEEE Trans. Knowl. Data Eng. 9(3), 435\u2013447 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"57_CR5","unstructured":"Bill of materials. https:\/\/en.wikipedia.org\/wiki\/Bill_of_materials"},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Lin, W., Xiao, X., Ghinita, G.: Large-scale frequent subgraph mining in mapreduce. In: ICDE, pp. 844\u2013855 (2014)","DOI":"10.1109\/ICDE.2014.6816705"},{"issue":"3","key":"57_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","volume":"27","author":"M Bhuiyan","year":"2015","unstructured":"Bhuiyan, M., Hasan, M.A.: An iterative mapreduce based frequent subgraph mining algorithm. IEEE Trans. Knowl. Data Eng. 27(3), 608\u2013620 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: SIGMOD, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"57_CR9","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: ICDM, pp. 721\u2013724 (2002)"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-index: towards verification-free query processing on graph databases. In: SIGMOD, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"issue":"2","key":"57_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"Jiawei Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD, pp. 1\u201312 (2000)","journal-title":"ACM SIGMOD Record"},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Wang, C., Wang, W., Pei, J., Zhu, Y., Shi, B.: Scalable mining of large disk-based graph databases. In: KDD, pp. 316\u2013325 (2004)","DOI":"10.1145\/1014052.1014088"},{"key":"57_CR15","unstructured":"Nguyen, S.N., Orlowska, M.E., Li, X.: Graph mining based on a data partitioning approach. In: ADC, pp. 31\u201337 (2008)"},{"key":"57_CR16","doi-asserted-by":"crossref","unstructured":"Miliaraki, I., Berberich, K., Gemulla, R., Zoupanos, S.: Mind the gap: large-scale frequent sequence mining. In: SIGMOD, pp. 797\u2013808 (2013)","DOI":"10.1145\/2463676.2465285"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Shao, B., Wang, H., Li, Y.: Trinity: a distributed graph engine on a memory cloud. In: SIGMOD, pp. 505\u2013516 (2013)","DOI":"10.1145\/2463676.2467799"},{"key":"57_CR18","doi-asserted-by":"crossref","unstructured":"Khayyat, Z., Awara, K., Alonazi, A., Jamjoom, H., Williams, D., Kalnis, P.: Mizan: a system for dynamic load balancing in large-scale graph processing. In: EuroSys, pp. 169\u2013182 (2013)","DOI":"10.1145\/2465351.2465369"},{"issue":"8","key":"57_CR19","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1093\/comjnl\/bxv118","volume":"59","author":"X Zhao","year":"2016","unstructured":"Zhao, X., Chen, Y., Xiao, C., Ishikawa, Y., Tang, J.: Frequent subgraph mining based on pregel. Comput. J. 59(8), 1113\u20131128 (2016)","journal-title":"Comput. J."},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In: WWW, pp. 1307\u20131317 (2015)","DOI":"10.1145\/2736277.2741096"},{"key":"57_CR21","unstructured":"Giraph - Welcome To Apache Giraph! http:\/\/giraph.apache.org\/"},{"key":"57_CR22","doi-asserted-by":"crossref","unstructured":"Wang, Z., Gu, Y., Bao, Y., Yu, G., Yu, J.X.: Hybrid pulling\/pushing for I\/O-efficient distributed and iterative graph computing. In: SIGMOD, pp. 479\u2013494 (2016)","DOI":"10.1145\/2882903.2882938"},{"key":"57_CR23","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: OSDI, vol. 12, no. 1, p. 2 (2012)"},{"key":"57_CR24","doi-asserted-by":"crossref","unstructured":"Peng, Z., Wang, T., Lu, W., Huang, H., Du, X., Zhao, F., Tung, A.K.H.: Mining frequent subgraphs from tremendous amount of small graphs using MapReduce. Knowl. Inf. Syst. 1\u201328 (2017)","DOI":"10.1007\/s10115-017-1104-7"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91452-7_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:19:04Z","timestamp":1751635144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-91452-7_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319914510","9783319914527"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91452-7_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ict.griffith.edu.au\/conferences\/dasfaa2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}