{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T01:31:34Z","timestamp":1649208694303},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0020-0255(94)90089-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"55-72","source":"Crossref","is-referenced-by-count":0,"title":["Cost-optimal parallel algorithms for constructing B-trees"],"prefix":"10.1016","volume":"81","author":[{"given":"Wang","family":"Biing-Feng","sequence":"first","affiliation":[]},{"given":"Chen","family":"Gen-Huey","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(94)90089-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0255(94)90089-2_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/0020-0255(94)90089-2_BIB3","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of data structure for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10.1016\/0020-0255(94)90089-2_BIB4","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1145\/358105.358191","article-title":"Efficient algorithm to globally balance binary search trees","volume":"27","author":"Chang","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/0020-0255(94)90089-2_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"Comput. Surveys"},{"key":"10.1016\/0020-0255(94)90089-2_BIB6","first-page":"360","article-title":"Balancing a binary tree","volume":"19","author":"Day","year":"1976","journal-title":"Comput. J."},{"issue":"6","key":"10.1016\/0020-0255(94)90089-2_BIB7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01407411","article-title":"Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree","volume":"15","author":"Dekel","year":"1986","journal-title":"Int. J. Parallel Program."},{"key":"10.1016\/0020-0255(94)90089-2_BIB8","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"issue":"6","key":"10.1016\/0020-0255(94)90089-2_BIB9","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1985.5009411","article-title":"A maximally parallel balancing algorithm for obtaining complete balanced binary trees","volume":"C-34","author":"Moitra","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0020-0255(94)90089-2_BIB10","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TSE.1986.6312885","article-title":"Derivation of a parallel algorithm for balanced binary trees","volume":"SE-12","author":"Moitra","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"10.1016\/0020-0255(94)90089-2_BIB11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0743-7315(91)90050-J","article-title":"Cost-optimal parallel algorithms for constructing 2\u20133 trees","volume":"11","author":"Wang","year":"1991","journal-title":"J. Parallel Distributed Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025594900892?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025594900892?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:52:49Z","timestamp":1552917169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025594900892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0020025594900892"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(94)90089-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}