

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
A problem-solving format that explains the concepts of fields, records, files, and databases in the context of file management. It covers the differences between these elements and provides definitions and examples of various file organizations. Students will gain a solid understanding of file management principles.
Typology: Essays (high school)
1 / 3
This page cannot be seen from the preview
Don't miss anything!


A field is the basic element of data. A field contains a single value such as employee’s name, a date, or the values. Fields may be fixed or variable length depends on file design. A record is a collection of related fields that can be treated as a one group by some application program. An employee record contains such fields as name, social security number, job classification, date and so on. If fields are variable length then records also variable length. Records are fixed or variable length depends on the fields design
Differences between a file and database:
A file management system is a set of system software that provides services to users and applications in the use of files, including file access, directory maintenance, and access control. The file management system is typically viewed as a system service that itself is served by the operating system, rather than being part of the operating system itself. However, in any system, at least part of the file management function is performed by the operating system.
In choosing a file organization several criteria are important
The Pile The least complicated form of file organization may be termed the pile. Data are collected in the order in which they arrive. Each record consists of one burst of data. The purpose of the pile is simply to accumulate the mass of data and save it. Records may have different fields, or similar fields in different orders. The Sequential File The most common form of file structure is the sequential file. In this type of file, a fixed format is used for records. All records are of the same length, consisting of the same number of fixed-length fields in a particular order. Because the length and position of each field are known, only the values of fields need to be stored; the field name and length for each field are attributes of the file structure. The Indexed Sequential File A popular approach to overcoming the disadvantages of the sequential file is the indexed sequential file. The indexed sequential file maintains the key characteristic of the sequential file: Records are organized in sequence based on a key field. Two features are added: an index to the file to support random access, and an overflow file. The index provides a lookup capability to reach quickly the vicinity of a desired record. The overflow file is similar to the log file used with a sequential file but is integrated so a record in the overflow file is located by following a pointer from its predecessor record. The Indexed File The indexed sequential file retains one limitation of the sequential file: Effective processing is limited to that which is based on a single field of the file. For example, when it is necessary to search for a record on the basis of some other attribute than the key field, both forms of sequential file are inadequate. In some applications, the flexibility of efficiently searching by various attributes is desirable. The Direct or Hashed File The direct, or hashed, file exploits the capability found on disks to access directly any block of a known address. As with sequential and indexed sequential files, a key field is required in each record. However, there is no concept of sequential ordering here. The direct file makes use of hashing on the key value. This function is explained in Hash Table, shows the type of hashing organization with an overflow file that is typically used in a hash file.