{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T16:36:05Z","timestamp":1711989365154},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T00:00:00Z","timestamp":1426809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10766-015-0355-8","type":"journal-article","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T06:27:04Z","timestamp":1426746424000},"page":"466-485","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Tree Accumulations on MapReduce"],"prefix":"10.1007","volume":"44","author":[{"given":"Kiminori","family":"Matsuzaki","sequence":"first","affiliation":[]},{"given":"Reina","family":"Miyazaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"issue":"2","key":"355_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"KR Abrahamson","year":"1989","unstructured":"Abrahamson, K.R., Dadoun, N., Kirkpatrick, D.G., Przytycka, T.M.: A simple parallel tree contraction algorithm. J. Algorithms 10(2), 287\u2013302 (1989)","journal-title":"J. Algorithms"},{"key":"355_CR2","volume-title":"Introduction to Functional Programming Using Haskell","author":"R Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming Using Haskell. Prentice-Hall, New York (1998)"},{"issue":"11","key":"355_CR3","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"GE Blelloch","year":"1989","unstructured":"Blelloch, G.E.: Scans as primitive parallel operations. IEEE Trans. Comput. 38(11), 1526\u20131538 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"355_CR4","doi-asserted-by":"crossref","unstructured":"Choi, H., Lee, K.H., Kim, S.H., Lee, Y.J., Moon, B.: HadoopXML: a suite for parallel processing of massive XML data with multiple twig pattern queries. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM\u201912), pp. 2737\u20132739. ACM (2012)","DOI":"10.1145\/2396761.2398745"},{"key":"355_CR5","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI2004), pp. 137\u2013150 (2004)"},{"issue":"2","key":"355_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00453-001-0109-4","volume":"33","author":"FKHA Dehne","year":"2002","unstructured":"Dehne, F.K.H.A., Ferreira, A., C\u00e1ceres, E., Song, S.W., Roncato, A.: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica 33(2), 183\u2013200 (2002)","journal-title":"Algorithmica"},{"key":"355_CR7","doi-asserted-by":"crossref","unstructured":"Emoto, K., Imachi, H.: Parallel tree reduction on MapReduce. In: Proceedings of the International Conference on Computational Science (ICCS 2012), Procedia Computer Science, vol. 9, pp. 1827\u20131836. Elsevier, Amsterdam (2012)","DOI":"10.1016\/j.procs.2012.04.201"},{"key":"355_CR8","doi-asserted-by":"crossref","unstructured":"Gazit, H., Miller, G.L., Teng, S.H.: Optimal tree contraction in EREW model. In: Proceedings of the Princeton Workshop on Algorithms, Architectures, and Technical Issues for Models of Concurrent Computation, pp. 139\u2013156 (1987)","DOI":"10.1007\/978-1-4684-5511-3_9"},{"key":"355_CR9","unstructured":"Gibbons, J.: Algebras for tree algorithms. Ph.D. thesis, Programming Research Group, University of Oxford (1991)"},{"issue":"1","key":"355_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(96)00114-4","volume":"169","author":"J Gibbons","year":"1996","unstructured":"Gibbons, J.: Computing downwards accumulations on trees quickly. Theor. Comput. Sci. 169(1), 67\u201380 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"355_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6423(99)00022-2","volume":"37","author":"J Gibbons","year":"2000","unstructured":"Gibbons, J.: Generic downwards accumulations. Sci. Comput. Progr. 37(1\u20133), 37\u201365 (2000)","journal-title":"Sci. Comput. Progr."},{"issue":"1","key":"355_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(94)00013-1","volume":"23","author":"J Gibbons","year":"1994","unstructured":"Gibbons, J., Cai, W., Skillicorn, D.B.: Efficient parallel algorithms for tree accumulations. Sci. Comput. Progr. 23(1), 1\u201318 (1994)","journal-title":"Sci. Comput. Progr."},{"key":"355_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF03037434","volume":"17","author":"Z Hu","year":"1999","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Calculating accumulations. New Gener. Comput. 17, 153\u2013173 (1999)","journal-title":"New Gener. Comput."},{"key":"355_CR14","doi-asserted-by":"crossref","unstructured":"Kakehi, K., Matsuzaki, K., Emoto, K.: Efficient parallel tree reductions on distributed memory environments. In: Proceedings of the 7th International Conference on Computational Science (ICCS 2007), Part II, Lecture Notes in Computer Science, vol. 4488, pp. 601\u2013608. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72586-2_88"},{"key":"355_CR15","unstructured":"Kakehi, K., Matsuzaki, K., Emoto, K., Hu, Z.: A practicable framework for tree reductions under distributed memory environments. Tech. Rep. METR 2006-64, Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo (2006)"},{"issue":"1","key":"355_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.scico.2007.07.001","volume":"70","author":"R L\u00e4mmel","year":"2008","unstructured":"L\u00e4mmel, R.: Google\u2019s MapReduce programming model\u2014revisited. Sci. Comput. Progr. 70(1), 1\u201330 (2008)","journal-title":"Sci. Comput. Progr."},{"issue":"1","key":"355_CR17","first-page":"18","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Emoto, K., Matsuzaki, K., Hu, Z.: Accumulative computation on MapReduce. IPSJ Trans. Progr. 7(1), 18\u201327 (2014)","journal-title":"IPSJ Trans. Progr."},{"key":"355_CR18","doi-asserted-by":"crossref","unstructured":"Matsuzaki, K.: Efficient implementation of tree accumulations on distributed-memory parallel computers. In: Proceedings of the 7th International Conference on Computational Science (ICCS 2007), Part II, Lecture Notes in Computer Science, vol. 4488, pp. 609\u2013616. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72586-2_89"},{"issue":"7\u20138","key":"355_CR19","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.parco.2006.06.002","volume":"32","author":"K Matsuzaki","year":"2006","unstructured":"Matsuzaki, K., Hu, Z., Takeichi, M.: Parallel skeletons for manipulating general trees. Parallel Comput. 32(7\u20138), 590\u2013603 (2006)","journal-title":"Parallel Comput."},{"key":"355_CR20","unstructured":"Meertens, L.: First Steps Towards the Theory of Rose Trees. CWI, Amsterdam; IFIP Working Group 2.1 Working Paper 592 ROM-25 (1988)"},{"key":"355_CR21","doi-asserted-by":"crossref","unstructured":"Mignet, L., Barbosa, D., Veltri, P.: The XML web: A first study. In: Proceedings of the 12th International Conference on World Wide Web (WWW\u201903), pp. 500\u2013510. ACM, New York (2003)","DOI":"10.1145\/775152.775223"},{"key":"355_CR22","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Reif, J.H.: Parallel tree contraction and its application. In: 26th Annual Symposium on Foundations of Computer Science, pp. 478\u2013489. IEEE Computer Society (1985)","DOI":"10.1109\/SFCS.1985.43"},{"issue":"3","key":"355_CR23","first-page":"51","volume":"24","author":"Y Nomura","year":"2007","unstructured":"Nomura, Y., Emoto, K., Matsuzaki, K., Hu, Z., Takeichi, M.: Parallelization of XPath queries with tree skeletons. Comput. Softw. 24(3), 51\u201362 (2007). (In Japanese)","journal-title":"Comput. Softw."},{"key":"355_CR24","doi-asserted-by":"crossref","unstructured":"Pardo, A.: Generic accumulations. In: Proceedings of the IFIP TC2\/WG2.1 Working Conference on Generic Programming, pp. 49\u201378 (2003)","DOI":"10.1007\/978-0-387-35672-3_3"},{"key":"355_CR25","unstructured":"Reif, J.H. (ed.): Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, Burlington, MA (1993)"},{"issue":"1","key":"355_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.jpdc.2004.09.001","volume":"65","author":"FE Sevilgen","year":"2005","unstructured":"Sevilgen, F.E., Aluru, S., Futamura, N.: Parallel algorithms for tree accumulations. J. Parallel Distrib. Comput. 65(1), 85\u201393 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"355_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526626","volume-title":"Foundations of Parallel Programming","author":"DB Skillicorn","year":"1994","unstructured":"Skillicorn, D.B.: Foundations of Parallel Programming. Cambridge University Press, Cambridge (1994)"},{"issue":"2","key":"355_CR28","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1006\/jpdc.1996.0160","volume":"39","author":"DB Skillicorn","year":"1996","unstructured":"Skillicorn, D.B.: Parallel implementation of tree skeletons. J. Parallel Distrib. Comput. 39(2), 115\u2013125 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"355_CR29","first-page":"42","volume":"3","author":"DB Skillicorn","year":"1997","unstructured":"Skillicorn, D.B.: Structured parallel computation in structured documents. J. Univers. Comput. Sci. 3(1), 42\u201368 (1997)","journal-title":"J. Univers. Comput. Sci."},{"issue":"8","key":"355_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990)","journal-title":"Commun. ACM"},{"key":"355_CR31","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop: The Definitive Guide. O\u2019Reilly Media \/ Yahoo Press, Sebastopol, CA (2012)"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0355-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-015-0355-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0355-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T04:14:47Z","timestamp":1566447287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-015-0355-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,20]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s10766-015-0355-8","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,20]]}}}
