{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:39:14Z","timestamp":1776134354777,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"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":[[2014,6,18]]},"DOI":"10.1145\/2588555.2593662","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"731-742","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Patience is a virtue"],"prefix":"10.1145","author":[{"given":"Badrish","family":"Chandramouli","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Goldstein","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-99-00796-X"},{"key":"e_1_3_2_1_2_1","unstructured":"Sergei Bespamyatnikh and Michael Segal. Enumerating Longest Increasing Subsequences and Patience Sorting. Pacific Inst. for the Math. Sci. Preprints PIMS-99--3. pp.7--8.  Sergei Bespamyatnikh and Michael Segal. Enumerating Longest Increasing Subsequences and Patience Sorting. Pacific Inst. for the Math. Sci. Preprints PIMS-99--3. pp.7--8."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1004036"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/944618.944627"},{"key":"e_1_3_2_1_5_1","volume-title":"SODA","author":"P. Gopalan","year":"2007"},{"key":"e_1_3_2_1_6_1","unstructured":"A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. Volume 7 (1997) pp. 370--379.   A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. Volume 7 (1997) pp. 370--379."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.55"},{"key":"e_1_3_2_1_8_1","unstructured":"TimSort. http:\/\/en.wikipedia.org\/wiki\/Timsort.  TimSort. http:\/\/en.wikipedia.org\/wiki\/Timsort."},{"key":"e_1_3_2_1_9_1","unstructured":"Sorting Algorithms. http:\/\/en.wikipedia.org\/wiki\/ Sort_algorithms.  Sorting Algorithms. http:\/\/en.wikipedia.org\/wiki\/ Sort_algorithms."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359631"},{"key":"e_1_3_2_1_11_1","unstructured":"GNU Quicksort Implementation. http:\/\/aka.ms\/X5ho47.  GNU Quicksort Implementation. http:\/\/aka.ms\/X5ho47."},{"key":"e_1_3_2_1_12_1","unstructured":"Patience Sorting. http:\/\/en.wikipedia.org\/wiki\/ Patience_sorting.  Patience Sorting. http:\/\/en.wikipedia.org\/wiki\/ Patience_sorting."},{"key":"e_1_3_2_1_13_1","volume-title":"Sorting and Searching","volume":"3","author":"Knuth Donald","year":"1998"},{"key":"e_1_3_2_1_14_1","first-page":"4","volume":"5","year":"1962","journal-title":"C.A.R. Hoare. Quicksort. Computer J."},{"key":"e_1_3_2_1_15_1","first-page":"216","volume":"9","author":"Mallows C.L.","year":"1973","journal-title":"Bull. Inst. Math. Appl."},{"key":"e_1_3_2_1_16_1","first-page":"345","volume-title":"Proc. Sixth Berkeley Symp. Math. Statist. and Probability","volume":"1","author":"Hammersley J.M.","year":"1972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465293"},{"key":"e_1_3_2_1_18_1","unstructured":"Splunk. http:\/\/www.splunk.com\/.  Splunk. http:\/\/www.splunk.com\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454171"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1209012"},{"key":"e_1_3_2_1_22_1","volume-title":"Hash Revisited. In VLDB","author":"Multi-Core C. Balkesen","year":"2014"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336678"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"}],"event":{"name":"SIGMOD\/PODS'14: International Conference on Management of Data","location":"Snowbird Utah USA","acronym":"SIGMOD\/PODS'14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2593662","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2588555.2593662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:09Z","timestamp":1750272969000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2588555.2593662"}},"subtitle":["revisiting merge and sort on modern processors"],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":24,"alternative-id":["10.1145\/2588555.2593662","10.1145\/2588555"],"URL":"https:\/\/doi.org\/10.1145\/2588555.2593662","relation":{},"subject":[],"published":{"date-parts":[[2014,6,18]]},"assertion":[{"value":"2014-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}