{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T05:15:28Z","timestamp":1648962928867},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge and Information Systems"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1007\/bf03325109","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T18:40:09Z","timestamp":1374777609000},"page":"435-457","source":"Crossref","is-referenced-by-count":0,"title":["Run Placement Policies for Concurrent Mergesorts Using Parallel Prefetching"],"prefix":"10.1007","volume":"1","author":[{"given":"Kun-Lung","family":"Wu","sequence":"first","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"James Z.","family":"Teng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,13]]},"reference":[{"issue":"9","key":"BF03325109_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"A. Aggarwal, J. S. Vitter. The input\/output complexity of sorting and related problems, Communications of the ACM 31(9), 1116\u20131127, 1988.","journal-title":"Communications of the ACM"},{"key":"BF03325109_CR2","unstructured":"H. Chou, D. DeWitt. An evaluation of buffer management strategies for relational database systems. In: Proc. of Very Large Data Bases, 1985, pp. 127-141."},{"issue":"3","key":"BF03325109_CR3","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/319989.319991","volume":"8","author":"DJ Witt De","year":"1983","unstructured":"D.J. DeWitt, D. Bitton, H. Boral, W. K. Wilkinson. Parallel algorithms for relational database operations, ACM Trans. on Database Systems 8(3), 324\u2013353, 1983.","journal-title":"ACM Trans. on Database Systems"},{"key":"BF03325109_CR4","unstructured":"C. Faloutsos, R. Ng, T. Sellis. Predictive load control for flexible buffer allocation.In: Proc. of Very Large Data Bases, 1991, pp.265-274."},{"key":"BF03325109_CR5","unstructured":"B. R. Iyer, D. M. Dias. System issues in parallel sorting for database systems. In: Proc. of Int. Conf. on Data Engineering, 1990, pp.246-255."},{"key":"BF03325109_CR6","unstructured":"D. E. Knuth. The Art of Computer Programming\u2014Vol 3: Sorting and Searching, Addison-Wesley, 1973."},{"issue":"4","key":"BF03325109_CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TC.1985.5009392","volume":"34","author":"S C Kwan","year":"1985","unstructured":"S. C. Kwan, J. L. Baer. The I\/O performance of multiway mergesort and tag sort, IEEE Trans. Computers 34(4), 383\u2013387, 1985.","journal-title":"IEEE Trans. Computers"},{"key":"BF03325109_CR8","unstructured":"S. S. Lavenberg (eds.). Computer Performance Modeling Handbook, Academic Press, 1983."},{"key":"BF03325109_CR9","doi-asserted-by":"crossref","unstructured":"R. Ng, C. Faloutsos, T. Sellis. Flexible buffer allocation based on marginal gains. In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1991, pp. 387-396.","DOI":"10.1145\/119995.115857"},{"key":"BF03325109_CR10","unstructured":"V. S. Pai, P. J. Verman. Prefetching with multiple disks for external mergesort: Simulation and analysis. In: Proc. Int. Conf. on Data Engineering, 1992, pp. 273-282."},{"key":"BF03325109_CR11","doi-asserted-by":"crossref","unstructured":"D. A. Patterson, G. Gibson, R. H. Katz. A case for redundant arrays of inexpensive disks (RAID). In: Proc. of ACM SIGMOD Int. Conf. on Management of Data, 1988, pp. 109-116, 1988.","DOI":"10.1145\/971701.50214"},{"issue":"4","key":"BF03325109_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/7239.7336","volume":"11","author":"G M Sacco","year":"1986","unstructured":"G. M. Sacco, M. Schkolnick. Buffer management in relational database systems, ACM Trans. Database Systems 11(4), 473\u2013498, 1986.","journal-title":"ACM Trans. Database Systems"},{"key":"BF03325109_CR13","doi-asserted-by":"crossref","unstructured":"K. Salem, H. Garcia-Molina. Disk striping. In: Proc. Int. Conf. on Data Engineering, 1986, pp. 336-342.","DOI":"10.1109\/ICDE.1986.7266238"},{"key":"BF03325109_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00572988","volume":"27","author":"B Salzberg","year":"1989","unstructured":"B. Salzberg. Merging sorted runs using large main memory, Acta Informatica 27, 195\u2013215, 1989.","journal-title":"Acta Informatica"},{"key":"BF03325109_CR15","unstructured":"J. Z. Teng. DB2 buffer pool management, Lecture notes in Dallas DB2 Users Group meeting, January 1992."},{"key":"BF03325109_CR16","unstructured":"K.-L. Wu, P. S. Yu, J.-Y. Chung, J. Z. Teng. A performance study of workfile disk management for concurrent mergesorts in a multiprocessor database system. In: Proc. 1995 VLDB, 1995, pp. 100-109."},{"key":"BF03325109_CR17","unstructured":"K.-L. Wu, P. S. Yu, J. Z. Teng. Performance comparison of thrashing control policies for concurrent mergesorts with parallel prefetching. In: Proc. 1993 ACM SIGMETRICS, 1993, pp. 171-182."},{"issue":"1","key":"BF03325109_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01231797","volume":"2","author":"P S Yu","year":"1993","unstructured":"P. S. Yu, D. W. Cornell. Buffer management based on return on consumption in a multi-query environment, VLDB Journal 2(1), 1\u201337, 1993.","journal-title":"VLDB Journal"},{"issue":"2","key":"BF03325109_CR19","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/69.494169","volume":"8","author":"L Zheng","year":"1996","unstructured":"L. Zheng, P.-A. Larson. Speeding up external mergesort, IEEE Trans. Knowledge and Data Engineering 8(2), 322\u2013332, 1996.","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03325109\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03325109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T12:21:52Z","timestamp":1563538912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03325109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["BF03325109"],"URL":"https:\/\/doi.org\/10.1007\/bf03325109","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}