{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:28:55Z","timestamp":1648618135905},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,3,1]],"date-time":"1978-03-01T00:00:00Z","timestamp":257558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1978,3]]},"DOI":"10.1007\/bf02252192","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T13:24:25Z","timestamp":1132061065000},"page":"17-35","source":"Crossref","is-referenced-by-count":0,"title":["A performance model for preplanned disk sorting"],"prefix":"10.1007","volume":"21","author":[{"given":"R.","family":"Bayer","sequence":"first","affiliation":[]},{"given":"T.","family":"H\u00e4rder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02252192_CR1","unstructured":"(BH 76) Bayer, R., Haerder, T.: Preplanning of Disk Merges. IBM Research Report, RJ 1853, San Jose."},{"key":"BF02252192_CR2","doi-asserted-by":"crossref","unstructured":"(BPV 74) Hyafil, L., Prusker, F., Vuillemin, J.: An Efficient Algorithm for Computing Optimal Disk Merge Patterns, Proceedings of the ACM Symposium on theory of computing, Seattle, April 1974, pp. 216\u2013229.","DOI":"10.1145\/800119.803899"},{"key":"BF02252192_CR3","unstructured":"(IBM 1) Introduction to IBM System\/360: Direct Access Storage Devices and Organization Methods, IBM Student Text, Form-No.: C 20-1649."},{"key":"BF02252192_CR4","unstructured":"(IBM 2) IBM OS\/VS Sort\/Merge General Information, Form-No.: GC 33-4033-2, IBM, White Plains, NY 10604, U.S.A."},{"key":"BF02252192_CR5","volume-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"D. E. Knuth","year":"1972","unstructured":"(Kn 72) Knuth, D. E.: The Art of Computer Programming, Vol. 3, Sorting and Searching. Reading, Mass.: Addison-Wesley 1972."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252192.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252192\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:21:40Z","timestamp":1586560900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,3]]}},"alternative-id":["BF02252192"],"URL":"https:\/\/doi.org\/10.1007\/bf02252192","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,3]]}}}