{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:38:13Z","timestamp":1743025093571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030959029"},{"type":"electronic","value":"9783030959036"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95903-6_45","type":"book-chapter","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T13:03:32Z","timestamp":1643720612000},"page":"430-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Survey on\u00a0MapReduce Subgraph Enumeration Algorithms"],"prefix":"10.1007","author":[{"given":"Xiaozhou","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yudi","family":"Santoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Thomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Fotakis, D., Ullman, J.D.: Enumerating subgraph instances using map-reduce. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 62\u201373. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In: Srinivasan, S., Ramamritham, K., Kumar, A., Ravindra, M.\u00a0P., Bertino, E., Kumar, R. (eds.) Proceedings of the 20th International Conference on World Wide Web, pp. 587\u2013596. ACM Press (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, P.: The WebGraph framework I: compression techniques. In: Proceedings of the Thirteenth International World Wide Web Conference (WWW 2004), Manhattan, USA, pp. 595\u2013601. ACM Press (2004)","DOI":"10.1145\/988672.988752"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00f6cheler, M., Pugliese, A., Subrahmanian, V.S.: Cosi: cloud oriented subgraph identification in massive social networks. In: 2010 International Conference on Advances in Social Networks Analysis and Mining, pp. 248\u2013255. IEEE (2010)","DOI":"10.1109\/ASONAM.2010.80"},{"issue":"4","key":"45_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MCSE.2009.120","volume":"11","author":"J Cohen","year":"2009","unstructured":"Cohen, J.: Graph twiddling in a MapReduce world. Comput. Sci. Eng. 11(4), 29 (2009)","journal-title":"Comput. Sci. Eng."},{"issue":"10","key":"45_CR6","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters (2008)","DOI":"10.1145\/1327452.1327492"},{"issue":"8","key":"45_CR8","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"45_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.socnet.2010.03.004","volume":"32","author":"K Faust","year":"2010","unstructured":"Faust, K.: A puzzle concerning triads in social networks: graph constraints and the triad census. Soc. Netw. 32(3), 221\u2013233 (2010)","journal-title":"Soc. Netw."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics, 21(suppl_1), i213\u2013i221 (2005)","DOI":"10.1093\/bioinformatics\/bti1049"},{"issue":"10","key":"45_CR11","doi-asserted-by":"publisher","first-page":"974","DOI":"10.14778\/2794367.2794368","volume":"8","author":"L Lai","year":"2015","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in MapReduce. Proc. VLDB Endow. 8(10), 974\u2013985 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1\u20133","key":"45_CR12","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Santoso, Y., Thomo, A., Srinivasan, V.: Distributed enumeration of four node graphlets at quadrillion-scale. In: SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management, pp. 85\u201396 (2021)","DOI":"10.1145\/3468791.3468805"},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Milenkovi\u0107, T., Pr\u017eulj, N.: Uncovering biological network function via graphlet degree signatures. Cancer Inform. 6 (2008)","DOI":"10.4137\/CIN.S680"},{"issue":"5594","key":"45_CR15","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"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Chung, C.-W.: An efficient MapReduce algorithm for counting triangles in a very large graph. In: 22nd ACM International Conference on Information and Knowledge Management, CIKM\u201913, San Francisco, CA, USA, 27 October\u20131 November, pp. 539\u2013548 (2013)","DOI":"10.1145\/2505515.2505563"},{"key":"45_CR17","doi-asserted-by":"crossref","unstructured":"Park, H.-M., Myaeng, S.-H., Kang, U.: PTE: enumerating trillion triangles on distributed systems. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1115\u20131124. ACM (2016)","DOI":"10.1145\/2939672.2939757"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Park, H.M., Silvestri, F., Kang, U., Pagh, R.: MapReduce triangle enumeration with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, CIKM 2014, Shanghai, China, 3\u20137 November 2014, pp. 1739\u20131748 (2014)","DOI":"10.1145\/2661829.2662017"},{"issue":"6","key":"45_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3237191","volume":"12","author":"HM Park","year":"2018","unstructured":"Park, H.M., Silvestri, F., Pagh, R., Chung, C.W., Myaeng, S.H., Kang, U.: Enumerating trillion subgraphs on distributed systems. ACM Trans. Knowl. Discov. Data (TKDD) 12(6), 1\u201330 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"issue":"2","key":"45_CR20","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"8","key":"45_CR21","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Netw. 18(8), 1093\u20131110 (2005)","journal-title":"Neural Netw."},{"issue":"2","key":"45_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3433652","volume":"54","author":"P Ribeiro","year":"2021","unstructured":"Ribeiro, P., Paredes, P., Silva, M.E., Aparicio, D., Silva, F.: A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Comput. Surv. 54(2), 1\u201336 (2021)","journal-title":"ACM Comput. Surv."},{"key":"45_CR23","unstructured":"Santoso, Y., Srinivasan, V., Thomo, A.: Efficient enumeration of four node graphlets at trillion-scale. In: 23rd EDBT, pp. 439\u2013442 (2020)"},{"key":"45_CR24","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web, WWW \u201911. ACM, New York (2011)","DOI":"10.1145\/1963405.1963491"},{"issue":"2\u20133","key":"45_CR25","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1002\/pmic.201400233","volume":"15","author":"SWH Wong","year":"2015","unstructured":"Wong, S.W.H., Cercone, N., Jurisica, I.: Comparative network analysis via differential graphlet communities. Proteomics 15(2\u20133), 608\u2013617 (2015)","journal-title":"Proteomics"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Internet, Data & Web Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95903-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T13:09:33Z","timestamp":1643720973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95903-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030959029","9783030959036"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95903-6_45","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"2 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EIDWT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Emerging Internetworking, Data & Web Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Okayama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eidwt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}