{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:08:44Z","timestamp":1649081324317},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":[[1989,1]]},"DOI":"10.1016\/0306-4379(89)90043-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"151-162","source":"Crossref","is-referenced-by-count":3,"title":["Analysis of overflow handling for variable length records"],"prefix":"10.1016","volume":"14","author":[{"given":"S","family":"Christodoulakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.-\u00c5","family":"Larson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(89)90043-4_BIB1","series-title":"Proc. ACM-SIGMOD-83 Conf.","first-page":"40","article-title":"Estimating block transfers and join sizes","author":"Christodoulakis","year":"1983"},{"issue":"2","key":"10.1016\/0306-4379(89)90043-4_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/329.318578","article-title":"Implications of certain assumptions in data base performance evaluation","volume":"9","author":"Christodoulakis","year":"1984","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0306-4379(89)90043-4_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/357994.358025","article-title":"Optimal pagination of B-trees with variable-length items","volume":"27","author":"Diehr","year":"1984","journal-title":"Commun. ACM"},{"issue":"2","key":"10.1016\/0306-4379(89)90043-4_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01933187","article-title":"On the distribution of wasted space at the end of file blocks","volume":"20","author":"Hakola","year":"1980","journal-title":"BIT"},{"issue":"8","key":"10.1016\/0306-4379(89)90043-4_BIB5","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1145\/4021.4026","article-title":"Efficient optimal pagination of scrolls","volume":"28","author":"Larmore","year":"1985","journal-title":"Commun. ACM"},{"issue":"9","key":"10.1016\/0306-4379(89)90043-4_BIB6","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/359810.359839","article-title":"Pagination of B-trees with variablelength records","volume":"20","author":"McCreight","year":"1977","journal-title":"Commun. ACM"},{"issue":"6","key":"10.1016\/0306-4379(89)90043-4_BIB7","first-page":"271","article-title":"Designing magnetic tape files for variable length records","volume":"3","author":"Montgomery","year":"1974","journal-title":"Mgmt Informatics"},{"issue":"1","key":"10.1016\/0306-4379(89)90043-4_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00289139","article-title":"Optimal multiway search trees for variable size keys","volume":"21","author":"Szwarcfiter","year":"1984","journal-title":"Acta Informatica"},{"key":"10.1016\/0306-4379(89)90043-4_BIB9","series-title":"Database Design","author":"Wienderhold","year":"1983"},{"issue":"4","key":"10.1016\/0306-4379(89)90043-4_BIB10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/319628.319665","article-title":"Analysis of index-sequential files with overflow chaining","volume":"6","author":"Larson","year":"1981","journal-title":"ACM Trans. Database Systems"},{"issue":"2","key":"10.1016\/0306-4379(89)90043-4_BIB11","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/319682.319696","article-title":"Optimal file designs and reorganization points","volume":"7","author":"Batory","year":"1982","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/0306-4379(89)90043-4_BIB12","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/1270.318575","article-title":"The average time until bucket overflows","volume":"9","author":"Cooper","year":"1984","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/0306-4379(89)90043-4_BIB13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/319758.319771","article-title":"Mathematical models of database degradation","volume":"7","author":"Heyman","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0306-4379(89)90043-4_BIB14","series-title":"Proc. ACM-SIGMOD Workshop on Data Description, Access and Control","first-page":"389","article-title":"Analysis of indexed sequential and direct access file organizations","author":"Behymer","year":"1974"},{"issue":"1","key":"10.1016\/0306-4379(89)90043-4_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(76)90091-0","article-title":"A distributed index sequential access method","volume":"5","author":"Gairola","year":"1976","journal-title":"Inform. Process Letts"},{"issue":"3","key":"10.1016\/0306-4379(89)90043-4_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00996829","article-title":"On the design of one-level indexed sequential files","volume":"10","author":"Leipala","year":"1981","journal-title":"Int. J. Comput. Inform. Sci."},{"issue":"5","key":"10.1016\/0306-4379(89)90043-4_BIB17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0190(82)90115-6","article-title":"On optimal multilevel indexed sequential files","volume":"15","author":"Leipala","year":"1982","journal-title":"Inform. Process. Letts"},{"issue":"5","key":"10.1016\/0306-4379(89)90043-4_BIB18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0190(86)90105-5","article-title":"Batched search of index sequential files","volume":"22","author":"Manolopoulos","year":"1986","journal-title":"Inform. Process. Letts"},{"issue":"11","key":"10.1016\/0306-4379(89)90043-4_BIB19","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/360363.360370","article-title":"Optimal reorganization of distributed space disk files","volume":"19","author":"Maruyama","year":"1976","journal-title":"Commun. ACM"},{"issue":"5","key":"10.1016\/0306-4379(89)90043-4_BIB20","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/355602.361304","article-title":"An improved index sequential access method using hashed overflow","volume":"15","author":"Mullin","year":"1972","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/0306-4379(89)90043-4_BIB21","first-page":"95","article-title":"An analysis of ISAM performance improvement options","volume":"4","author":"Wong","year":"1975","journal-title":"Mgmt Datamatics"},{"key":"10.1016\/0306-4379(89)90043-4_BIB22","series-title":"Design of Database Structures","author":"Teorey","year":"1982"},{"issue":"3","key":"10.1016\/0306-4379(89)90043-4_BIB23","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1147\/sj.133.0186","article-title":"VSAM data design parameters","volume":"13","author":"Keen","year":"1974","journal-title":"IBM Systems J."},{"key":"10.1016\/0306-4379(89)90043-4_BIB24","series-title":"The Art of Computer Programming. Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(89)90043-4_BIB25","series-title":"File organizations for variable length records","author":"Christodoulakis","year":"1987"},{"key":"10.1016\/0306-4379(89)90043-4_BIB26","volume":"Vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/0306-4379(89)90043-4_BIB27","series-title":"Proc. VLDB-78 Conf.","first-page":"489","article-title":"An analysis of storage utilization in block split data structuring scheme","author":"Nakamura","year":"1978"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437989900434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437989900434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:53:54Z","timestamp":1552625634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437989900434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0306437989900434"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(89)90043-4","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}