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
Synchronization can be achieved by means other than locks and condition variables. One alternative is semaphores. A semaphore is used to regulate traf?c in a critical section. A se

What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t

KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl

What is virtual memory? Virtual memory is a method that allows the execution of processes that might not be completely in memory. It is the separation of user logical memory fr

Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best

From hardware perspective, every information system can be divided into three task areas Presentation, Application Logic and Data Storage. The R/3 Basis software is extremely s

Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori

Q. More than one disk drive is able to be attached to a SCSI bus. Especially a fast wide SCSI-II bus can be connected to at most 15 disk drives. Remember that this bus has a bandw

Consider a particular system that does not have an interrupting clock.  The only way a thread can lose the processor is to voluntarily surrender it.  Additionally, the operating sy

Contiguous allocation The contiguous-allocation method needs each file to occupy a set of contiguous blocks of the disk. Disk addresses explain a linear ordering on the disk. T