{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:08:37Z","timestamp":1780538917078,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642255908","type":"print"},{"value":"9783642255915","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_39","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"374-383","source":"Crossref","is-referenced-by-count":117,"title":["Sorting, Searching, and Simulation in the MapReduce Framework"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nodari","family":"Sitchinava","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"39_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/174652.174661","volume":"41","author":"N. Alon","year":"1994","unstructured":"Alon, N., Megiddo, N.: Parallel linear programming in fixed dimension almost surely in constant time. J. ACM\u00a041(2), 422\u2013434 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"39_CR2","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","key":"39_CR3","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J. Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: MapReduce: a flexible data processing tool. Commun. ACM\u00a053(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"key":"39_CR4","unstructured":"DeWitt, D.J., Stonebraker, M.: MapReduce: A major step backwards. Database Column (2008), \n                    \n                      http:\/\/databasecolumn.vertica.com\/database-innovation\/mapreduce-a-major-step-backwards\/"},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00607-006-0214-y","volume":"79","author":"S.C. Eisenstat","year":"2007","unstructured":"Eisenstat, S.C.: O(log*\n                  n) algorithms on a Sum-CRCW PRAM. Computing\u00a079(1), 93\u201397 (2007)","journal-title":"Computing"},{"key":"39_CR6","unstructured":"Feldman, J., Muthukrishnan, S., Sidiropoulos, A., Stein, C., Svitkina, Z.: On distributing symmetric streaming computations. In: Teng, S.H. (ed.) SODA, pp. 710\u2013719. SIAM (2008)"},{"key":"39_CR7","unstructured":"Goodrich, M.T.: Randomized fully-scalable BSP techniques for multi-searching and convex hull construction. In: SODA, pp. 767\u2013776 (1997)"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/S0097539795294141","volume":"29","author":"M.T. Goodrich","year":"1999","unstructured":"Goodrich, M.T.: Communication-efficient parallel sorting. SIAM Journal on Computing\u00a029(2), 416\u2013432 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR9","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the mapreduce framework (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1101.1902"},{"key":"39_CR10","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334\u2013343 (1988)","DOI":"10.1145\/62212.62244"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proc. ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 938\u2013948 (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. ACM\u00a033, 103\u2013111 (1990)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T04:06:25Z","timestamp":1555733185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}