{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:15:36Z","timestamp":1775283336059,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1247480.1247602","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"1029-1040","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":437,"title":["Map-reduce-merge"],"prefix":"10.1145","author":[{"given":"Hung-chih","family":"Yang","sequence":"first","affiliation":[{"name":"Yahoo!, Sunnyvale, CA"}]},{"given":"Ali","family":"Dasdan","sequence":"additional","affiliation":[{"name":"Yahoo!, Sunnyvale, CA"}]},{"given":"Ruey-Lung","family":"Hsiao","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA"}]},{"given":"D. Stott","family":"Parker","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"http:\/\/lucene.apache.org\/hadoop\/","year":"2006","unstructured":"Apache. Hadoop. http:\/\/lucene.apache.org\/hadoop\/ , 2006 . Apache. Hadoop. http:\/\/lucene.apache.org\/hadoop\/, 2006."},{"key":"e_1_3_2_1_2_1","first-page":"243","volume-title":"High-Performance Sorting on Networks of Workstations. In SIGMOD 1997","author":"A.","year":"1997","unstructured":"A. C. Arpaci-Dusseau et al . High-Performance Sorting on Networks of Workstations. In SIGMOD 1997 , pages 243 -- 254 , 1997 . A. C. Arpaci-Dusseau et al. High-Performance Sorting on Networks of Workstations. In SIGMOD 1997, pages 243--254, 1997."},{"key":"e_1_3_2_1_3_1","volume-title":"Readings in Database Systems","author":"Brewer E. A.","year":"2005","unstructured":"E. A. Brewer . Combining Systems and Databases: A Search Engine Retrospective . In J. M. Hellerstein and M. Stonebraker, editors, Readings in Database Systems , Fourth Edition, Cambridge, MA , 2005 . MIT Press . E. A. Brewer. Combining Systems and Databases: A Search Engine Retrospective. In J. M. Hellerstein and M. Stonebraker, editors, Readings in Database Systems, Fourth Edition, Cambridge, MA, 2005. MIT Press."},{"key":"e_1_3_2_1_4_1","first-page":"205","volume-title":"OSDI","author":"Chang F.","year":"2006","unstructured":"F. Chang : A Distributed Storage System for Structured Data . In OSDI , pages 205 -- 218 , 2006 . F. Chang et al. Bigtable: A Distributed Storage System for Structured Data. In OSDI, pages 205--218, 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781517"},{"key":"e_1_3_2_1_6_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI, pages 137--150, 2004."},{"key":"e_1_3_2_1_7_1","first-page":"228","volume-title":"GAMMA-A High Performance Dataflow Database Machine. In VLDB 1986","author":"D.","year":"1986","unstructured":"D. J. DeWitt et al . GAMMA-A High Performance Dataflow Database Machine. In VLDB 1986 , pages 228 -- 237 , 1986 . D. J. DeWitt et al. GAMMA-A High Performance Dataflow Database Machine. In VLDB 1986, pages 228--237, 1986."},{"key":"e_1_3_2_1_8_1","first-page":"1985","year":"1985","unstructured":"D. J. DeWitt and Gerber. R. Multiprocessor Hash-Based Join Algorithms. In VLDB 1985 , 1985 . D. J. DeWitt and Gerber. R. Multiprocessor Hash-Based Join Algorithms. In VLDB 1985, 1985.","journal-title":"D. J. DeWitt and Gerber. R. Multiprocessor Hash-Based Join Algorithms. In VLDB"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/129888.129894"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_11_1","unstructured":"J. Gray. Sort Benchmark. http:\/\/research.microsoft.com\/barc\/SortBenchmark\/ 2006.  J. Gray. Sort Benchmark. http:\/\/research.microsoft.com\/barc\/SortBenchmark\/ 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1107499.1107503"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_14_1","unstructured":"R. L\u00e4mmel. Google's MapReduce Programming Model - Revisited. Draft; Online since 2 January 2006; 26 pages 22 Jan. 2006.  R. L\u00e4mmel. Google's MapReduce Programming Model - Revisited. Draft; Online since 2 January 2006; 26 pages 22 Jan. 2006."},{"issue":"4","key":"e_1_3_2_1_15_1","first-page":"227","volume":"13","author":"Pike R.","year":"2005","unstructured":"R. Pike Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal , 13 ( 4 ): 227 -- 298 , 2005 . R. Pike et al. Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal, 13(4):227--298, 2005.","journal-title":"Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal"},{"key":"e_1_3_2_1_16_1","volume-title":"http:\/\/www.teradata.com\/t\/go.aspx","year":"2006","unstructured":"Teradata. Teradata. http:\/\/www.teradata.com\/t\/go.aspx , 2006 . Teradata. Teradata. http:\/\/www.teradata.com\/t\/go.aspx, 2006."},{"key":"e_1_3_2_1_17_1","volume-title":"http:\/\/www.tpc.org\/tpch\/default.asp","author":"PC.","year":"2006","unstructured":"T PC. TPC-H. http:\/\/www.tpc.org\/tpch\/default.asp , 2006 . TPC. TPC-H. http:\/\/www.tpc.org\/tpch\/default.asp, 2006."},{"key":"e_1_3_2_1_18_1","unstructured":"Wikipedia. Redundant Array of Inexpensive Nodes. http:\/\/en.wikipedia.org\/wiki\/Redundant Array of Inexpensive Nodes 2006.  Wikipedia. Redundant Array of Inexpensive Nodes. http:\/\/en.wikipedia.org\/wiki\/Redundant Array of Inexpensive Nodes 2006."}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","location":"Beijing China","acronym":"SIGMOD\/PODS07","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2007 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:38Z","timestamp":1750258058000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247602"}},"subtitle":["simplified relational data processing on large clusters"],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":18,"alternative-id":["10.1145\/1247480.1247602","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247602","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}