Relative file organization

A relative file is an array of fixed-length slots and the records can be inserted in the first free slot found from the beginning of the file and at the end of the file or in a specified slot in the file. Relative files are habitually used when record number will access records directly. Since each of the slots in a relative file is the same size, SFS is able to calculate the position of a specific record (identified by record number) by multiplying the record number by the record slot size.

The records in a relative file is able to be composed of fixed or variable-length fields except the size of each slot in the file is that of the maximum record size (which is calculated from the record specification when a relative file is created). The records in a relative file are able to be updated or deleted in place. Any slots free when records are deleted are able to be reused by subsequent insertions.

The primary index or else a relative file are based on the relative slot number (RSN), which correspond to the number of the slot occupied by a record the first relative slot number in a file is slot number 0 and the highest slot number can't exceed the maximum number of records specified when the file was created and the RSN is a physical part of the user's data record in Contrast this with the ESN used in entry-sequenced files. While a relative file is created at least one field must be of type sfs_unsignedInt32. This field ought to be specified as the primary index

 

Posted Date: 6/19/2013 6:11:36 AM | Location : United States

Ask an Expert

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

Write discussion on Explain relative file organization
Your posts are moderated

Write your message here..

Related Questions

Competing process, describe competing process describe competing process

Explain the per thread scoping, Explain the Per Thread Scoping Thread-l... Explain the Per Thread Scoping Thread-level programming introduces new twists for application-level variable scoping. Threads are commonly used in one of two ways. To ex

Under what circumstances do page faults occur, Under what circumstances do ... Under what circumstances do page faults occur?  Describe the actions taken by the operating system when a page fault occurs. A page fault happens when an access to a page that

Why is rotational latency not considered in disk scheduling, Q. Why is rota... Q. Why is rotational latency typically not considered in disk scheduling? How would you alter SSTF, SCAN and C-SCAN to comprise latency optimization? Answer: Most disks don't

What are the advantages of linked allocation, What are the advantages of Li... What are the advantages of Linked allocation? The benefits are a. No external fragmentation b. Size of the file does not require to be declared

Ipc, explain in detail about ipc in linux explain in detail about ipc in linux

Kernel mode and user mode function, Q. How does the distinction among kerne... Q. How does the distinction among kernel mode and user mode function as a rudimentary form of protection (security) system? Answer: The distinction among kernel mode and user m

What are the allocation methods of a disk space, What are the allocation me... What are the allocation methods of a disk space? Methods of allocating disk space which are widely in use are a. Contiguous allocation b. Linked allocation c. Indexed

Write a note on deadlocks, Write a note on deadlocks. The proper defini... Write a note on deadlocks. The proper definition of deadlock A set of processes is deadlocked if every process in the set is waiting for an event that only a proces

Computers, What is operating system? What is operating system?