{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:29:45Z","timestamp":1754486985720},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986,1]]},"DOI":"10.1016\/0306-4379(86)90005-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"167-175","source":"Crossref","is-referenced-by-count":14,"title":["Batch insertion for tree structured file organizations\u2014improving differential database representation"],"prefix":"10.1016","volume":"11","author":[{"given":"S.D.","family":"Lang","sequence":"first","affiliation":[]},{"given":"J.R.","family":"Driscoll","sequence":"additional","affiliation":[]},{"given":"J.H.","family":"Jou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0306-4379(86)90005-0_BIB1","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/320473.320484","article-title":"Differential Files: Their Application to the Maintenance of Large Databases","volume":"1","author":"Severence","year":"1976","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"10.1016\/0306-4379(86)90005-0_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/320521.320540","article-title":"Physical Integrity in a Large Segmented Database","volume":"2","author":"Lorie","year":"1977","journal-title":"ACM Trans. Database Syst."},{"issue":"7","key":"10.1016\/0306-4379(86)90005-0_BIB3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time Trade-offs in Hash Coding with Allowable Errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/0306-4379(86)90005-0_BIB4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1093\/comjnl\/24.4.367","article-title":"Change Area B-trees: A Technique to Aid Error Recovery","volume":"24","author":"Mullin","year":"1981","journal-title":"Computer Journal"},{"issue":"4","key":"10.1016\/0306-4379(86)90005-0_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0306-4379(80)90077-0","article-title":"Database Maintenance Efficiency Using Differential Files","volume":"5","author":"Kollias","year":"1980","journal-title":"Inf. Syst. (GB)"},{"issue":"4","key":"10.1016\/0306-4379(86)90005-0_BIB6","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/319758.319762","article-title":"A Practical Guide to the Design of Differential Files for Recovery of Online Databases","volume":"7","author":"Aghili","year":"1982","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"10.1016\/0306-4379(86)90005-0_BIB7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/320557.320558","article-title":"Optimal Policy for Batch Operations: Backup, Checkpointing, Reorganization, and Updating","volume":"2","author":"Lohman","year":"1977","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0306-4379(86)90005-0_BIB8","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 Informatica"},{"key":"10.1016\/0306-4379(86)90005-0_BIB9","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(86)90005-0_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The Ubiquitous B-tree","volume":"11","author":"Corner","year":"1979","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0306-4379(86)90005-0_BIB11","unstructured":"OS\/VS Virtual Storage Access Method (VSAM) Planning Guide. Armonk, NY: IBM. Order No. GC26\u20133799."},{"key":"10.1016\/0306-4379(86)90005-0_BIB12","unstructured":"OS\/VS Virtual Storage Access Method (VSAM) Logic, Armonk. NY: IBM, Order No. SY26\u20133841."},{"key":"10.1016\/0306-4379(86)90005-0_BIB13","year":"1979"},{"key":"10.1016\/0306-4379(86)90005-0_BIB14","first-page":"155","article-title":"Discrete Mathematics in Computer Science","author":"Stanat","year":"1977"},{"issue":"6","key":"10.1016\/0306-4379(86)90005-0_BIB15","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/362248.362267","article-title":"Optimum Database Reorganization Points","volume":"16","author":"Shneiderman","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(86)90005-0_BIB16","series-title":"Standard Mathematical Tables","first-page":"392","year":"1962"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437986900050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437986900050?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:08Z","timestamp":1552611188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437986900050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0306437986900050"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(86)90005-0","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}