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
What are turnaround time and response time? Turnaround time is the interval among the submission of a job and its completion. Response time is the interval among submission

How is memory management done using bit maps? A bit map is here in this we signify the bit value as 0 or 1. 1-hole 0-process In this we are able to represent the proce

Explain the steps in deadlock recovery. a)      Exterminate off all processes involved - drastic. b)      Exterminate off one at a time till deadlock gone - select a victim.

Take the binary number and divide it into groups of 4 bits starting from the right hand side , if no group of 4 exists fill out leading 0's, then convert each group of 4 to a hex n

what is network operating? explain about it design issues?

Explain briefly the working of semaphore with example ? The E.W. Dijkstra (1965) abstracted the key idea of mutual exclusion in his concepts of semaphores. Definition A s

socket based fortune teller sever.your program should create a server that listens to a specific port when a client receives a connection the server should respond with a random fo

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 are the advantages of Indexed allocation? The benefits are a. No external-fragmentation problem b. Solves the size-declaration problems. c. Supports direct access

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne