{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T02:21:27Z","timestamp":1794450087983,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642394669","type":"print"},{"value":"9783642394676","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39467-6_18","type":"book-chapter","created":{"date-parts":[[2013,6,24]],"date-time":"2013-06-24T21:33:16Z","timestamp":1372109596000},"page":"189-203","source":"Crossref","is-referenced-by-count":11,"title":["Bisimulation Reduction of Big Graphs on MapReduce"],"prefix":"10.1007","author":[{"given":"Yongming","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannick","family":"de Lange","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George H. L.","family":"Fletcher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"De Bra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Hidders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuqing","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Afrati, F.N., Sarma, A.D., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a Map-Reduce computation. CoRR, abs\/1206.4377 (2012)"},{"key":"18_CR2","unstructured":"Bader, D.A., Madduri, K.: GTgraph: A suite of synthetic graph generators, \n                    \n                      http:\/\/www.cse.psu.edu\/~madduri\/software\/GTgraph\/index.html"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s10009-004-0159-4","volume":"7","author":"S. Blom","year":"2005","unstructured":"Blom, S., Orzan, S.: A distributed algorithm for strong bisimulation reduction of state spaces. Int. J. Softw. Tools Technol. Transfer\u00a07, 74\u201386 (2005)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Proc. VLDB, Berlin, Germany, pp. 141\u2013152 (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A. Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C., Newman, M.: Power-law distributions in empirical data. SIAM Review\u00a051(4), 661\u2013703 (2009)","journal-title":"SIAM Review"},{"issue":"4","key":"18_CR6","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. Computing in Science Engineering\u00a011(4), 29\u201341 (2009)","journal-title":"Computing in Science Engineering"},{"key":"18_CR7","unstructured":"de Lange, Y.: MapReduce based algorithms for localized bisimulation. Master\u2019s thesis, Eindhoven University of Technology (2013)"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"1-3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comp. Sci.\u00a0311(1-3), 221\u2013256 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: Proc. ICDT, Berlin, Germany, pp. 8\u201321 (2012)","DOI":"10.1145\/2274576.2274578"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W., Li, J., Wang, X., Wu, Y.: Query preserving graph compression. In: Proc. SIGMOD, Scottsdale, AZ, USA, pp. 157\u2013168 (2012)","DOI":"10.1145\/2213836.2213855"},{"key":"18_CR12","unstructured":"Gufler, B., Augsten, N., Reiser, A., Kemper, A.: Handling data skew in MapReduce. In: Proc. CLOSER, pp. 574\u2013583 (2011)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gufler, B., Augsten, N., Reiser, A., Kemper, A.: Load balancing in MapReduce based on scalable cardinality estimates. In: Proc. ICDE, pp. 522\u2013533 (2012)","DOI":"10.1109\/ICDE.2012.58"},{"key":"18_CR14","unstructured":"Hadoop (2012), \n                    \n                      http:\/\/hadoop.apache.org\/"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Ibrahim, S., Jin, H., Lu, L., Wu, S., He, B., Qi, L.: LEEN: Locality\/fairness-aware key partitioning for MapReduce in the cloud. In: CloudCom, pp. 17\u201324 (2010)","DOI":"10.1109\/CloudCom.2010.25"},{"key":"18_CR16","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: ICDE, San Jose, pp. 129\u2013140 (2002)"},{"issue":"1","key":"18_CR17","first-page":"24","volume":"36","author":"Y. Kwon","year":"2013","unstructured":"Kwon, Y., Ren, K., Balazinska, M., Howe, B.: Managing Skew in Hadoop. IEEE Data Eng. Bull.\u00a036(1), 24\u201333 (2013)","journal-title":"IEEE Data Eng. Bull."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Lin, J., Dyer, C.: Data-Intensive Text Processing with MapReduce. Synthesis Lectures on Human Language Technologies. Morgan & Claypool Publishers (2010)","DOI":"10.2200\/S00274ED1V01Y201006HLT007"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Lin, J., Schatz, M.: Design patterns for efficient graph algorithms in MapReduce. In: Proc. MLG, Washington, D.C., pp. 78\u201385 (2010)","DOI":"10.1145\/1830252.1830263"},{"key":"18_CR20","unstructured":"Luo, Y., Fletcher, G.H.L., Hidders, J., Wu, Y., De Bra, P.: I\/O-efficient algorithms for localized bisimulation partition construction and maintenance on massive graphs. CoRR, abs\/1210.0748 (2012)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput.\u00a016, 973 (1987)","journal-title":"SIAM J. Comput."},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-30284-8_34","volume-title":"The Semantic Web: Research and Applications","author":"F. Picalausa","year":"2012","unstructured":"Picalausa, F., Luo, Y., Fletcher, G.H.L., Hidders, J., Vansummeren, S.: A structural approach to indexing triples. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol.\u00a07295, pp. 406\u2013421. Springer, Heidelberg (2012)"},{"key":"18_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777110","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"D. Sangiorgi","year":"2011","unstructured":"Sangiorgi, D., Rutten, J.: Advanced Topics in Bisimulation and Coinduction. Cambridge University Press, New York (2011)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Vernica, R., Balmin, A., Beyer, K.S., Ercegovac, V.: Adaptive MapReduce using situation-aware mappers. In: Proc. EDBT, pp. 420\u2013431 (2012)","DOI":"10.1145\/2247596.2247646"}],"container-title":["Lecture Notes in Computer Science","Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39467-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:45:15Z","timestamp":1557841515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39467-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642394669","9783642394676"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39467-6_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-39467-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}