{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:04Z","timestamp":1725670024481},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642288685"},{"type":"electronic","value":"9783642288692"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28869-2_13","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:44:36Z","timestamp":1332434676000},"page":"254-273","source":"Crossref","is-referenced-by-count":9,"title":["Generate, Test, and Aggregate"],"prefix":"10.1007","author":[{"given":"Kento","family":"Emoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-642-87374-4_1","volume-title":"Logic of Programming and Calculi of Discrete Design","author":"R. Bird","year":"1987","unstructured":"Bird, R.: An introduction to the theory of lists. In: Broy, M. (ed.) Logic of Programming and Calculi of Discrete Design, pp. 5\u201342. Springer, Heidelberg (1987)"},{"key":"13_CR2","unstructured":"Bird, R.: Introduction to Functional Programming using Haskell. Prentice Hall (1998)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bird, R., de Moor, O.: Algebras of Programming. Prentice Hall (1996)","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-45099-3_5","volume-title":"Static Analysis","author":"W.N. Chin","year":"2000","unstructured":"Chin, W.N., Khoo, S.C., Hu, Z., Takeichi, M.: Deriving Parallel Codes via Invariants. In: SAS 2000. LNCS, vol.\u00a01824, pp. 75\u201394. Springer, Heidelberg (2000)"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0129626495000175","volume":"5","author":"M. Cole","year":"1995","unstructured":"Cole, M.: Parallel programming with list homomorphisms. Parallel Processing Letters\u00a05(2), 191\u2013203 (1995)","journal-title":"Parallel Processing Letters"},{"key":"13_CR6","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. Communications of the ACM\u00a051, 107\u2013113 (2008)","journal-title":"Communications of the ACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fisher, A.L., Ghuloum, A.M.: Parallelizing complex scans and reductions. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation (PLDI 1994), pp. 135\u2013146. ACM (1994)","DOI":"10.1145\/773473.178255"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.L.: A short cut to deforestation. In: Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232 (1993)","DOI":"10.1145\/165180.165214"},{"key":"13_CR9","first-page":"573","volume":"25","author":"J. Goodman","year":"1999","unstructured":"Goodman, J.: Semiring parsing. Computational Linguistics\u00a025, 573\u2013605 (1999)","journal-title":"Computational Linguistics"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0024729","volume-title":"Euro-Par\u201996 - Parallel Processing","author":"S. Gorlatch","year":"1996","unstructured":"Gorlatch, S.: Systematic Efficient Parallelization of Scan and Other List Homomorphisms. In: Fraigniaud, P., Mignotte, A., Robert, Y., Boug\u00e9, L. (eds.) Euro-Par 1996. LNCS, vol.\u00a01124, pp. 401\u2013408. Springer, Heidelberg (1996)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0129626496000285","volume":"6","author":"Z. Grant-Duff","year":"1996","unstructured":"Grant-Duff, Z., Harrison, P.: Parallelism via homomorphism. Parallel Processing Letters\u00a06(2), 279\u2013295 (1996)","journal-title":"Parallel Processing Letters"},{"key":"13_CR12","unstructured":"He, Y.: Extended viterbi algorithm for second order hidden markov process. In: 9th International Conference on Pattern Recognition, vol.\u00a02, pp. 718\u2013720. IEEE Press (1988)"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/TSP.2005.861753","volume":"54","author":"T.J. Ho","year":"2006","unstructured":"Ho, T.J., Chen, B.S.: Novel extended viterbi-based multiple-model algorithms for state estimation of discrete-time systems with markov jump parameters. IEEE Transactions on Signal Processing\u00a054(2), 393\u2013404 (2006)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/268946.268972","volume-title":"25th ACM Symposium on Principles of Programming Languages (POPL 1998)","author":"Z. Hu","year":"1998","unstructured":"Hu, Z., Takeichi, M., Chin, W.N.: Parallelization in calculational forms. In: 25th ACM Symposium on Principles of Programming Languages (POPL 1998), pp. 316\u2013328. ACM Press, San Diego (1998)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11877028_5","volume-title":"Generative and Transformational Techniques in Software Engineering","author":"Z. Hu","year":"2006","unstructured":"Hu, Z., Yokoyama, T., Takeichi, M.: Program Optimizations and Transformations in Calculation Form. In: L\u00e4mmel, R., Saraiva, J., Visser, J. (eds.) GTTSE 2005. LNCS, vol.\u00a04143, pp. 144\u2013168. Springer, Heidelberg (2006)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 938\u2013948. SIAM (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Lin, J., Dyer, C.: Data-Intensive Text Processing with MapReduce. Morgan and Claypool Publishers (2010)","DOI":"10.3115\/1620950.1620951"},{"key":"13_CR18","unstructured":"List, M.A.P. (2011), \n                  \n                    http:\/\/www.mendeley.com\/groups\/1058401\/mapreduce-applications\/papers\/"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-23397-5_5","volume-title":"Euro-Par 2011 Parallel Processing","author":"Y. Liu","year":"2011","unstructured":"Liu, Y., Hu, Z., Matsuzaki, K.: Towards Systematic Parallel Programming over MapReduce. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol.\u00a06853, pp. 39\u201350. Springer, Heidelberg (2011)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Morita, K., Morihata, A., Matsuzaki, K., Hu, Z., Takeichi, M.: Automatic inversion generates divide-and-conquer parallel programs. In: ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI 2007), pp. 146\u2013155. ACM Press (2007)","DOI":"10.1145\/1250734.1250752"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Sato, S., Iwasaki, H.: Automatic parallelization via matrix multiplication. In: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2011), pp. 470\u2013479. ACM (2011)","DOI":"10.1145\/1993498.1993554"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Skillicorn, D.B.: The Bird-Meertens Formalism as a Parallel Model. In: NATO ARW \u201cSoftware for Parallel Computation\u201d (1992)","DOI":"10.1007\/978-3-642-58049-9_9"},{"key":"13_CR23","first-page":"306","volume-title":"Proc.\u00a0Conference on Functional Programming Languages and Computer Architecture","author":"A. Takano","year":"1995","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proc.\u00a0Conference on Functional Programming Languages and Computer Architecture, pp. 306\u2013313. La Jolla, California (1995)"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Takano, A., Hu, Z., Takeichi, M.: Program transformation in calculational form. ACM Computing Surveys\u00a030(3) (1998)","DOI":"10.1145\/289121.289128"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Formal Models and Sematics, vol. B, pp. 133\u2013192. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, FPCA 1989, pp. 347\u2013359. ACM (1989)","DOI":"10.1145\/99370.99404"},{"key":"13_CR27","unstructured":"White, T.: Hadoop: The Definitive Guide. O\u2019Reilly Media (2009)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28869-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:47:55Z","timestamp":1578538075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28869-2_13"}},"subtitle":["A Calculation-based Framework for Systematic Parallel Programming with MapReduce"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642288685","9783642288692"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28869-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}