{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:33:37Z","timestamp":1648960417644},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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 Systems"],"published-print":{"date-parts":[[1987,1]]},"DOI":"10.1016\/0306-4379(87)90022-6","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"115-124","source":"Crossref","is-referenced-by-count":1,"title":["Achieving minimum height for block split tree structured files"],"prefix":"10.1016","volume":"12","author":[{"given":"James R.","family":"Driscoll","sequence":"first","affiliation":[]},{"given":"Sheau-Dong","family":"Lang","sequence":"additional","affiliation":[]},{"given":"Stephen M.","family":"Bratman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(87)90022-6_BIB1","series-title":"Proc. 1978 VLDB Conf.","first-page":"489","article-title":"An analysis of storage utilization factor in block split data structuring scheme","author":"Nakamura","year":"1978"},{"key":"10.1016\/0306-4379(87)90022-6_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0306-4379(87)90022-6_BIB3","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":"Ass. Comput. Mach. Comput. Surv."},{"key":"10.1016\/0306-4379(87)90022-6_BIB4","series-title":"Data Base Management Systems","author":"Cardenas","year":"1985"},{"key":"10.1016\/0306-4379(87)90022-6_BIB5","series-title":"2nd Annual IEEE Data Engineering Conf.","first-page":"524","article-title":"Improving the differential file technique via batch operations for tree structured file organizations","author":"Lang","year":"1986"},{"issue":"2","key":"10.1016\/0306-4379(87)90022-6_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0306-4379(86)90005-0","article-title":"Batch insertion for tree structured file organizations\u2014improving differential database representation","volume":"11","author":"Lang","year":"1986","journal-title":"Inform. Systems"},{"issue":"1","key":"10.1016\/0306-4379(87)90022-6_BIB7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/0208004","article-title":"Optimal 2, 3-trees","volume":"8","author":"Miller","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0306-4379(87)90022-6_BIB8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","article-title":"On random 2\u20133 trees","volume":"9","author":"Yao","year":"1978","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/0306-4379(87)90022-6_BIB9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0306-4379(80)90064-2","article-title":"Space utilization and access path length in B-trees","volume":"5","author":"Quitzow","year":"1980","journal-title":"Inform. Systems"},{"key":"10.1016\/0306-4379(87)90022-6_BIB10","series-title":"Proc. 1980 Ass. Comput. Mach. SIGMOD Conf.","first-page":"200","article-title":"Experiments with B-tree reorganization","author":"Gudes","year":"1980"},{"issue":"1","key":"10.1016\/0306-4379(87)90022-6_BIB11","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/319540.319565","article-title":"Time and space optimality in B-trees","volume":"6","author":"Rosenberg","year":"1981","journal-title":"Ass. comput. Mach. Trans. Database Systems"},{"key":"10.1016\/0306-4379(87)90022-6_BIB12","unstructured":"OS\/VS Virtual Storage Access Method(VSAM) Logic, Armonk, NY, IBM, Order No. SY26-3841."},{"key":"10.1016\/0306-4379(87)90022-6_BIB13","unstructured":"OS\/VS Virtual Storage Access Method (VSAM) Planning Guide. Armonk, NY, IBM, Order NO. GC26-3799."},{"key":"10.1016\/0306-4379(87)90022-6_BIB14","year":"1979"},{"key":"10.1016\/0306-4379(87)90022-6_BIB15","first-page":"63","article-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0306-4379(87)90022-6_BIB16","volume":"Vol. 1","author":"Feller","year":"1957"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437987900226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437987900226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:53:15Z","timestamp":1552611195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437987900226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0306437987900226"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(87)90022-6","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}