{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T04:06:38Z","timestamp":1742184398888,"version":"3.38.0"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1109\/tkde.2003.1209012","type":"journal-article","created":{"date-parts":[[2003,7,10]],"date-time":"2003-07-10T15:00:04Z","timestamp":1057849204000},"page":"961-972","source":"Crossref","is-referenced-by-count":18,"title":["External sorting: Run formation revisited"],"prefix":"10.1109","volume":"15","author":[{"given":"P.-A.","family":"Larson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/146370.146381"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58715-2_142"},{"issue":"1","key":"ref3","first-page":"48","article-title":"Longer Strings for Sorting","volume":"8","author":"Dinsmore","year":"1965","journal-title":"Comm. ACM"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/27.4.334"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/355604.361597"},{"key":"ref6","volume-title":"The Art of Computer Programming","volume":"1","author":"Knuth","year":"1997"},{"key":"ref7","volume-title":"The Art of Computer Programming","volume":"3","author":"Knuth","year":"1998"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/235141.235145"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0985"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276346"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191884"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1992.213183"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00572988"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384249"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.4.298"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/32.29490"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00052-6"},{"key":"ref18","first-page":"376","article-title":"Dynamic Memory Adjustment for External Mergesort","volume-title":"Proc. Very Large Data Bases Conf.","author":"Zhang"},{"key":"ref19","first-page":"523","article-title":"Buffering and Read-Ahead Strategies for External Mergesort","volume-title":"Proc. Very Large Data Bases Conf.","author":"Zhang"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/69.494169"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/27216\/01209012.pdf?arnumber=1209012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T04:41:09Z","timestamp":1742100069000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1209012\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,7]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2003.1209012","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}