{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:34:08Z","timestamp":1699835648913},"reference-count":28,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":9430,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1981,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Varieties of files are reviewed and the notion of a file space is discussed. A number of properties which characterize file spaces are listed. This modest theoretical framework has a clarifying influence on the subject of files. Certain file\u2010system primitives are introduced which are similar to those in most commonly\u2010known operating systems, and then these primitives are used in constructing a collection of routines for reading and writing extedible arrays. Extendible arrays are based on fixed page size randomly\u2010accessible files and they are a useful universal input\/output (I\/O) structure for many different storage and retrieval schemes. The routines for managing such files are similar to the mechanisms used in handling a paged address space in a virtual memory system. The contribution of this paper lies in the detailed implementation which is presented; these routines are well understood in principle, but tricky to construct in practice. Finally, these routines are used in a practical example which provides for managing a variable blocksize free space list within a extendible array.<\/jats:p>","DOI":"10.1002\/spe.4380110104","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T11:47:42Z","timestamp":1163764062000},"page":"63-84","source":"Crossref","is-referenced-by-count":1,"title":["Procedures for managing extendible array files"],"prefix":"10.1002","volume":"11","author":[{"given":"Gary D.","family":"Knott","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_2_1_2_2","volume-title":"DECSYSTEM10 Monitor Calls Manual","year":"1975"},{"issue":"3","key":"e_1_2_2_1_3_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/361268.361271","article-title":"TENEX, A paged time\u2010sharing system for the PDP\u201010","volume":"15","author":"Bobrow D. G.","journal-title":"CACM"},{"key":"e_1_2_2_1_4_2","unstructured":"J. W.Langnen \u2018The design and implementation of a multi\u2010level file system\u2019 Ph.D. Thesis Case Western Reserve University (1974) also Jennings Computer Center Report No. 1140."},{"key":"e_1_2_2_1_5_2","unstructured":"M. L.Schwart A storage hierarchical addressing space for a computer file system Ph.D. Thesis Case Western Reserve University (1973) also Jennings Computer Center Report No. 1144."},{"key":"e_1_2_2_1_6_2","volume-title":"The Art of Computer Programming: Vol. 3, Searching and Sorting","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/320576.320585"},{"key":"e_1_2_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1147\/sj.22.0086"},{"key":"e_1_2_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.205.0518"},{"key":"e_1_2_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/320544.320556"},{"issue":"1","key":"e_1_2_2_1_11_2","first-page":"80","article-title":"Principles of optimal page replacement","volume":"18","author":"Aho A. V.","year":"1971","journal-title":"AM"},{"key":"e_1_2_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/320493.320494"},{"key":"e_1_2_2_1_13_2","volume-title":"The Art of Computer Programming: Vol. 1, Fundamental Algorithms","author":"Knuth D. E.","year":"1973"},{"issue":"4","key":"e_1_2_2_2_2_1","first-page":"306","article-title":"Replacement algorithms for storage management in relational data bases","volume":"19","author":"Casey R. G.","year":"1976","journal-title":"C. Cheme."},{"key":"e_1_2_2_2_3_1","unstructured":"C. A.Crane \u2018Linear lists and priority queues as balanced binary trees\u2019 Ph.D. Thesis Computer Science Department Stanford University (1972)."},{"key":"e_1_2_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/363196.363204"},{"issue":"4","key":"e_1_2_2_2_5_1","first-page":"569","article-title":"File organization: on the selection of random access index points for sequential files","volume":"16","author":"Ghosh S. P.","year":"1969","journal-title":"AM"},{"key":"e_1_2_2_2_6_1","unstructured":"S. P.Ghosh Performance of file access methods IBM Research Report R\u00b0 1712 IBM San Jose Laboratory 1976."},{"issue":"3","key":"e_1_2_2_2_7_1","first-page":"249","article-title":"Disc access algorithms","volume":"14","author":"Higgins L. D.","year":"1971","journal-title":"C. Cheme."},{"key":"e_1_2_2_2_8_1","first-page":"539","volume-title":"Random access file organization for indirectly addressed records","author":"Olson C. A.","year":"1969"},{"key":"e_1_2_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.12.0130"},{"issue":"5","key":"e_1_2_2_2_10_1","article-title":"The DEMOS file system","volume":"11","author":"Powell M.","journal-title":"Op. Sys. Review"},{"key":"e_1_2_2_2_10_2","first-page":"33","volume-title":"Proc. of the Sixth Symp. on Op. Sys. Prinicples","year":"1977"},{"key":"e_1_2_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204024"},{"key":"e_1_2_2_2_12_1","doi-asserted-by":"crossref","unstructured":"R. M.Shapiro H.Sait R. E.Millstein A. W.Holt S.WarshallandL.Sempliner A Handbook on File Structuring ADR Inc. Report RADC\u2010TR\u201069\u2010313 Vol. 1 1969 Federal Clearinghouse No. AD697025.","DOI":"10.21236\/AD0697025"},{"key":"e_1_2_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/320263.320276"},{"key":"e_1_2_2_2_14_1","first-page":"1","volume-title":"Inf. Proc. Letters","author":"Stacey G. M.","year":"1971"},{"key":"e_1_2_2_2_15_1","first-page":"80","volume-title":"Inf. Proc. Letters","author":"vanDam A.","year":"1972"},{"key":"e_1_2_2_2_16_1","unstructured":"C. B.Weinstock \u2018Dynamic storage allocation techniques\u2019 Ph.D. Thesis Department of Computer Science Carnegie\u2010Mellon University 1976."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380110104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380110104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:48:47Z","timestamp":1699789727000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380110104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,1]]}},"alternative-id":["10.1002\/spe.4380110104"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380110104","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,1]]}}}