{"id":"https://openalex.org/W1503698146","doi":"https://doi.org/10.1007/978-3-642-25591-5_39","title":"Sorting, Searching, and Simulation in the MapReduce Framework","display_name":"Sorting, Searching, and Simulation in the MapReduce Framework","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1503698146","doi":"https://doi.org/10.1007/978-3-642-25591-5_39","mag":"1503698146"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-25591-5_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25591-5_39","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://arxiv.org/pdf/1101.1902.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["Department of Computer Science, University of California, Irvine, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015446804","display_name":"Nodari Sitchinava","orcid":"https://orcid.org/0000-0001-8876-4846"},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Nodari Sitchinava","raw_affiliation_strings":["MADALGO, Department of Computer Science, University of Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100418224","display_name":"Qin Zhang","orcid":"https://orcid.org/0000-0002-6851-3115"},"institutions":[{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Qin Zhang","raw_affiliation_strings":["MADALGO, Department of Computer Science, University of Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":13.0882,"has_fulltext":true,"cited_by_count":192,"citation_normalized_percentile":{"value":1.0,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"374","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.17669999599456787,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.17669999599456787,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.12770000100135803,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.11190000176429749,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8680652379989624},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7391799688339233},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5970268249511719},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.566196084022522},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4977720081806183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4363316297531128},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3806312382221222},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3331495225429535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09679439663887024}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8680652379989624},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7391799688339233},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5970268249511719},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.566196084022522},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4977720081806183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4363316297531128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3806312382221222},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3331495225429535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09679439663887024},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-25591-5_39","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-25591-5_39","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/674610d1-d78a-4b8d-87ab-82cce0a346ac","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/674610d1-d78a-4b8d-87ab-82cce0a346ac","pdf_url":"http://arxiv.org/pdf/1101.1902.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goodrich, M T, Sitchinava, N & Zhang, Q 2011 'Sorting, Searching, and Simulation in the MapReduce Framework'. < http://arxiv.org/pdf/1101.1902.pdf >","raw_type":"info:eu-repo/semantics/workingPaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.744.3811","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.744.3811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1101.1902.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/ca1b857b-a9b6-495e-9804-4dcc3d0d24b3","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/ca1b857b-a9b6-495e-9804-4dcc3d0d24b3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goodrich, M T, Sitchinava, N & Zhang, Q 2011, 'Sorting, Searching, and Simulation in the MapReduce Framework', Lecture Notes in Computer Science, vol. 7074, pp. 374-383. https://doi.org/10.1007/978-3-642-25591-5_39","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/674610d1-d78a-4b8d-87ab-82cce0a346ac","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/674610d1-d78a-4b8d-87ab-82cce0a346ac","pdf_url":"http://arxiv.org/pdf/1101.1902.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Goodrich, M T, Sitchinava, N & Zhang, Q 2011 'Sorting, Searching, and Simulation in the MapReduce Framework'. < http://arxiv.org/pdf/1101.1902.pdf >","raw_type":"info:eu-repo/semantics/workingPaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1503698146.pdf","grobid_xml":"https://content.openalex.org/works/W1503698146.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1598064945","https://openalex.org/W1607045547","https://openalex.org/W1843460390","https://openalex.org/W2006334273","https://openalex.org/W2007780422","https://openalex.org/W2027637765","https://openalex.org/W2032802723","https://openalex.org/W2037072488","https://openalex.org/W2038142281","https://openalex.org/W2045271686","https://openalex.org/W2046441184","https://openalex.org/W2051586153","https://openalex.org/W2077314450","https://openalex.org/W2097224604","https://openalex.org/W2120490947","https://openalex.org/W2144841199","https://openalex.org/W2157355837","https://openalex.org/W2173213060","https://openalex.org/W2625737557","https://openalex.org/W2951758761","https://openalex.org/W4213146104"],"related_works":["https://openalex.org/W2142481367","https://openalex.org/W3196321793","https://openalex.org/W3080705045","https://openalex.org/W2385527937","https://openalex.org/W2005880840","https://openalex.org/W2507465767","https://openalex.org/W4385305499","https://openalex.org/W2047674875","https://openalex.org/W4245066656","https://openalex.org/W2373597927"],"abstract_inverted_index":{"We":[0,19],"study":[1],"the":[2,13,24,38,39,53],"MapReduce":[3],"framework":[4],"from":[5],"an":[6],"algorithmic":[7,15],"standpoint,":[8],"providing":[9],"a":[10],"generalization":[11],"of":[12,27,37,55],"previous":[14],"models":[16,44],"for":[17,23],"MapReduce.":[18],"present":[20],"optimal":[21,35,50],"solutions":[22,51],"fundamental":[25],"problems":[26,54],"all-prefix-sums,":[28],"sorting":[29],"and":[30,42,60,62],"multi-searching.":[31],"Additionally,":[32],"we":[33],"design":[34],"simulations":[36],"well-established":[40],"PRAM":[41],"BSP":[43],"in":[45,49],"MapReduce,":[46],"immediately":[47],"resulting":[48],"to":[52],"computing":[56],"fixed-dimensional":[57],"linear":[58],"programming":[59],"2-D":[61],"3-D":[63],"convex":[64],"hulls.":[65]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":31},{"year":2018,"cited_by_count":22},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}