FILE ORGANIZATION IN LIBRARY AUTOMATION AND INFORMATION RETRIEVAL

Items of information that have been stored in a computer normally need to be accessed via their contents. In principle this is always possible by doing an exhaustive scan of the entire file of information, but to achieve the access efficiently we use some sort of organizing principle, a file organization or file structure, to reduce the amount anning. Typically the items retrieved are a response to a request which fully or partially specifies their contents. Often the file organization requires pre‐processing of the body of information so that a secondary body of information (an index or directory) may be created which in some sense reveals the contents of the file. So, ultimately file structures are time saving devices, where we pay for the time saved by extra storage. They enable us quickly to find items of information by completely or partially specifying their contents.

[1]  Donald R. King.  The Binary Vector as the Basis of an Inverted Index File. , 1974 .

[2]  Barry Litofsky,et al.  Utility of automatic classification systems for information storage and retrieval , 1969 .

[3]  Daniel Mcclure Murray,et al.  Document Retrieval Based on Clustered Files , 1972 .

[4]  George G. Dodd.  Elements of Data Management Systems , 1969, CSUR.

[5]  Ferdinand F. Leimkuhler.  A literature search and file organization model , 1968 .

[6]  Yale N. Patt.  Minimum Search Tree Structures for Data Partitioned into Pages , 1972, IEEE Transactions on Computers.

[7]  Larry E. Stanfel.  Optimal trees for a class of information retrieval problems , 1973, Inf. Storage Retr..

[8]  C. William Skinner,et al.  A heuristic approach to inductive inference in fact retrieval systems , 1974, Commun. ACM.

[9]  M. E D'Imperio.  Data structures and their representation in storage , 1969 .

[10]  James B. Rothnie,et al.  Attribute based file organization in a paged memory environment , 1974, CACM.

[11]  Donald B. Crouch.  Cluster Analysis: Bibliography , 1971, SIGIR Forum.

[12]  Terry A. Welch,et al.  BOUNDS ON INFORMATION RETRIEVAL EFFICIENCY IN STATIC FILE STRUCTURES. , 1971 .

[13]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[14]  Walter A. Burkhard,et al.  Some approaches to best-match file searching , 1973, Commun. ACM.

[15]  Noah S. Prywes,et al.  All-automatic processing for a large library , 1970, AFIPS '70 (Spring).

[16]  Gerard Salton,et al.  Manipulation of trees in information retrieval , 1962, CACM.

[17]  Bernard C. Reardon.  An adaptive information retrieval system using partial file inversion , 1974, Inf. Storage Retr..

[18]  Abraham Bookstein.  Hash coding with a non-unique search key , 1974, J. Am. Soc. Inf. Sci..

[19]  Richard G. Casey.  Design of tree structures for efficient querying , 1973, CACM.

[20]  Dennis G. Severance,et al.  The use of cluster analysis in physical data base design , 1975, VLDB '75.

[21]  Walter A. Burkhard.  Partial-match queries and file designs , 1975, VLDB '75.

[22]  Larry E. Stanfel.  Practical Aspects of Doubly Chained Trees for Retrieval , 1972, JACM.

[23]  Donald J. Hatfield,et al.  Program Restructuring for Virtual Memory , 1971, IBM Syst. J..

[24]  George H. Mealy,et al.  Another look at data , 1967, AFIPS '67 (Fall).

[25]  Eugene Wong,et al.  Canonical structure in attribute based file organization , 1971, CACM.

[26]  David Lefkovitz.  The Large Data Base File Structure Dilemma , 1975, J. Chem. Inf. Comput. Sci..

[27]  Philip A. Bernstein,et al.  Allocating Storage in Hierarchical Data Bases Using Traces , 1975, Inf. Syst..

[28]  Ralph M. Shoffner.  A technique for the organization of large files , 1962 .

[29]  Judea Pearl.  On the Storage Economy of Inferential Question-Answering Systems , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[30]  Donald B. Crouch,et al.  A file organization and maintenance procedure for dynamic document collections , 1975, Inf. Process. Manag..

[31]  Dennis G. Severance,et al.  A Parametric Model of Alternative File Structures , 1975, Inf. Syst..

[32]  Alfonso F. Cardenas.  Analysis and performance of inverted data base structures , 1975, CACM.

[33]  B. J. Dzubak,et al.  The organization of structured files , 1965, CACM.

[34]  Casper Richard Defiore.  An associative approach to data management , 1972 .

[35]  D. M. Murray.  A Scatter Storage Scheme for Dictionary Lookups , 1970 .

[36]  Martha E. Williams,et al.  Comparison of Document Data Bases. , 1971 .

[37]  G. M. Stacey,et al.  A performance study of some directory structures for large files , 1974, Inf. Storage Retr..

[38]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[39]  Werner Buchholz,et al.  File Organization and Addressing , 1963, IBM Syst. J..

[40]  Ted G. Lewis,et al.  Hash Table Methods , 1975, CSUR.

[41]  David K. Hsiao,et al.  A Model for Keyword Based File Structures and Access. , 1973 .

[42]  Michael E. Senko,et al.  Information Systems Records, Relations, Sets, Entities, and Things , 1975, Inf. Syst..

[43]  Michael E. Senko,et al.  Data Structures and Accessing in Data-Base Systems. I: Evolution of Information Systems , 1973, IBM Syst. J..

[44]  R. Mike Lea,et al.  Information Processing with an Associative Parallel Processor , 1975, Computer.

[45]  Robert William Engles,et al.  A Tutorial on Data-Base Organization , 1972 .

[46]  Philip M. Morse,et al.  Optimal Linear Ordering of Information Items , 1972, Oper. Res..

[47]  Ronald L. Rivest,et al.  Analysis of associative retrieval algorithms , 1974 .

[48]  Lesley Hodgkinson.  Computerisation in The Lancashire Library , 1975 .

[49]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[50]  Abraham Bookstein.  A hybrid access method for bibliographic records , 1974 .

[51]  Donald J. Hummel.  A Comparative Report on an On-Line Retrieval Service Employing Two Distinct Software Systems , 1975, J. Chem. Inf. Comput. Sci..

[52]  J. C. Gray,et al.  Compound data structure for computer aided design; a survey , 1967, ACM National Conference.

[53]  Vincent Y. Lum,et al.  Analysis of a complex data management access method by simulation modeling , 1970, AFIPS '70 (Fall).

[54]  H. Louis Jonkers,et al.  A straight forward and flexible design method for complex data-base management systems , 1973, Inf. Storage Retr..

[55]  David K. Hsiao.  A Generalized Record Organization , 1971, IEEE Transactions on Computers.

[56]  Dennis G. Severance,et al.  Identifier Search Mechanisms: A Survey and Generalized Model , 1974, CSUR.

[57]  Frank Harary,et al.  A formal system for information retrieval from files , 1970, Commun. ACM.

[58]  Alfonso F. Cardenas,et al.  Modeling and analysis of data base organization. The doubly chained tree structure , 1975, Inf. Syst..

[59]  Evan Leon Ivie.  Search procedures based on measures of relatedness between documents. , 1966 .

[60]  James R. Bell,et al.  The linear quotient hash code , 1970, CACM.

[61]  David C. Roberts,et al.  File Organization Techniques , 1972, Adv. Comput..

[62]  B. C. Griffith,et al.  The Structure of Scientific Literatures II: Toward a Macro- and Microstructure for Science , 1974 .

[63]  Vincent Y. Lum,et al.  Key-to-address transform techniques: a fundamental performance study on large existing formatted files , 1971, CACM.