{"id":"https://openalex.org/W2103086360","doi":"https://doi.org/10.1145/2588555.2593662","title":"Patience is a virtue","display_name":"Patience is a virtue","publication_year":2014,"publication_date":"2014-06-18","ids":{"openalex":"https://openalex.org/W2103086360","doi":"https://doi.org/10.1145/2588555.2593662","mag":"2103086360"},"language":"en","primary_location":{"id":"doi:10.1145/2588555.2593662","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2593662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067654293","display_name":"Badrish Chandramouli","orcid":"https://orcid.org/0000-0002-8468-4037"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Badrish Chandramouli","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111492493","display_name":"Jonathan Goldstein","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Goldstein","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5383,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93681146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"731","last_page":"742"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11719","display_name":"Data Quality and Management","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.767890453338623},{"id":"https://openalex.org/keywords/merge-sort","display_name":"Merge sort","score":0.7672909498214722},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7541278600692749},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7475787401199341},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5023610591888428},{"id":"https://openalex.org/keywords/quicksort","display_name":"Quicksort","score":0.42715099453926086},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4020337462425232},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35676109790802},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3488496243953705},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.21184402704238892}],"concepts":[{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.767890453338623},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.7672909498214722},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7541278600692749},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7475787401199341},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5023610591888428},{"id":"https://openalex.org/C2778937211","wikidata":"https://www.wikidata.org/wiki/Q486598","display_name":"Quicksort","level":4,"score":0.42715099453926086},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4020337462425232},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35676109790802},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3488496243953705},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.21184402704238892}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2588555.2593662","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2588555.2593662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1575331340","https://openalex.org/W1993755553","https://openalex.org/W2003515726","https://openalex.org/W2006656002","https://openalex.org/W2018543684","https://openalex.org/W2040046786","https://openalex.org/W2044261056","https://openalex.org/W2056014488","https://openalex.org/W2066885472","https://openalex.org/W2092954093","https://openalex.org/W2122403525","https://openalex.org/W2125529470","https://openalex.org/W2141389982","https://openalex.org/W2166955231","https://openalex.org/W2406955896","https://openalex.org/W3198160809","https://openalex.org/W4206470441"],"related_works":["https://openalex.org/W3037448952","https://openalex.org/W4300167273","https://openalex.org/W1493296159","https://openalex.org/W2765396134","https://openalex.org/W4229364780","https://openalex.org/W2085265870","https://openalex.org/W4320925713","https://openalex.org/W2552439138","https://openalex.org/W2362374543","https://openalex.org/W2898932275"],"abstract_inverted_index":{"The":[0],"vast":[1],"quantities":[2],"of":[3,22,63,68,74,80,141,147,153,186,189,215],"log-based":[4],"data":[5,8,26],"appearing":[6],"in":[7,14,27,110,183],"centers":[9],"has":[10],"generated":[11],"an":[12,117],"interest":[13,98],"sorting":[15,23,51,120,188],"almost-sorted":[16],"datasets.":[17],"We":[18],"revisit":[19],"the":[20,66,72,138,142,184],"problem":[21],"and":[24,30,56,71,82,93,166,194],"merging":[25,73,107],"main":[28,111],"memory,":[29],"show":[31,203],"that":[32,122,204],"a":[33,78,100],"long-forgotten":[34],"technique":[35,102,121],"called":[36,103],"Patience":[37,60,88],"Sort":[38,126],"can,":[39],"with":[40,47,134,191,213],"some":[41],"key":[42],"modifications,":[43],"be":[44],"made":[45],"competitive":[46,133],"today's":[48],"best":[49],"comparison-based":[50,144],"techniques":[52,146],"for":[53,90,106,173],"both":[54,91],"random":[55,92,164],"almost":[57,174],"sorted":[58,69,108,175],"data.":[59,95,176],"sort":[61,89,145,155,182,197],"consists":[62],"two":[64],"phases:":[65],"creation":[67],"runs,":[70],"these":[75,114],"runs.":[76],"Through":[77],"combination":[79],"algorithmic":[81],"architectural":[83],"innovations,":[84],"we":[85,123,178],"dramatically":[86],"improve":[87,199],"almost-ordered":[94],"Of":[96],"particular":[97],"is":[99,132,156],"new":[101],"ping-pong":[104],"merge":[105],"runs":[109],"memory.":[112],"Together,":[113],"innovations":[115],"produce":[116],"extremely":[118],"fast":[119],"call":[124],"P3":[125,154,196,207],"(for":[127],"Ping-Pong":[128],"Patience+":[129],"Sort),":[130],"which":[131],"or":[135],"better":[136],"than":[137,160,171],"popular":[139],"implementations":[140],"fastest":[143],"today.":[148],"For":[149],"example,":[150],"our":[151,205],"implementation":[152],"around":[157],"20%":[158,167],"faster":[159,170],"GNU":[161],"Quicksort":[162],"on":[163],"data,":[165],"to":[168,198,217],"4x":[169],"Timsort":[172],"Finally,":[177],"investigate":[179],"replacement":[180,200,208,221],"selection":[181],"context":[185],"single-pass":[187],"logs":[190],"bounded":[192],"disorder,":[193],"leverage":[195],"selection.":[201,222],"Experiments":[202],"proposal,":[206],"selection,":[209],"significantly":[210],"improves":[211],"performance,":[212],"speedups":[214],"3x":[216],"20x":[218],"over":[219],"classical":[220]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}