Define file organization, Operating System

File Organization

    * Sequential

    * Direct

    * Indexed

A file still if it is stored on a magnetic disk or CD-ROM disk may perhaps have a sequential file organization. These records in this type of sequential file (even though the file is on a medium that allows for direct access) may only be retrieved sequentially.

Alternatively, a file on disk is able to support random access to records if its file organization is either Direct or Indexed. With Indexed and Direct file organization random record access is achieved by means of a "key field".

With Direct file organization records are allocate relative record numbers based on a mathematical formula known as a hashing algorithm. For instance you input a Student ID Number a mathematical formula is applied to it, and the resultant value is the value that points to the storage location on disk where the record is able to be found.

An Indexed file comprises a table that relates key values (for example Student ID Number) to storage locations of the corresponding records. This table is called as the index. It is simply like the index of a book where the key value (topic) has a pointer to the storage location (page number) where the information is stored.

File Organization                     Supported Record Access

Sequential                                 Sequential

Direct                                        Sequential or Random

Indexed                                    Sequential or Random

Posted Date: 6/21/2013 3:37:47 AM | Location : United States







Related Discussions:- Define file organization, Assignment Help, Ask Question on Define file organization, Get Answer, Expert's Help, Define file organization Discussions

Write discussion on Define file organization
Your posts are moderated
Related Questions
Operations that are to be performed on a directory are Search for a file: We are able to find all files whose names match a exact pattern. Create a file: New files requi

We are faced with three major components of the page-fault service time. 1. Service the page-fault interrupts. 2. Read in the page. 3. Restart the processes.

Define secondary memory. This memory holds those pages that are not there in main memory. The secondary memory is usually a high speed disk. It is called as the swap device, an

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si


Explain Rehashing to Handle Collision Rehashing:  Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we

What factors are involved in choosing the host operating system?

Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. The center of the disk is the location having the fewest average distanc

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

MEMORY MANAGEMENT USING LINK LISTS The first one is for showing it is process or hole, second is for starting address and third is for length of the process and last is a point