Explain relative file organization, Operating System

Assignment Help:

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

 


Related Discussions:- Explain relative file organization

Several cpu-scheduling algorithms, Q. Several CPU-scheduling algorithms are...

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

Explain lru enhanced second chance algorithm, Enhanced Second chance algori...

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

What is page fault?, What is page fault? In the computer storage techno...

What is page fault? In the computer storage technology a page fault is an exception which is raised by the memory management unit when a requested page isn't mapped in physical

Batch oriented and interactive operating system., properies of Batch orient...

properies of Batch oriented and interactive operating system.

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

Multiprogramming., In a multiprogramming and time sharing environment sever...

In a multiprogramming and time sharing environment several users share the system simultaneously .what are two such problems?

Explain schemes for defining the logical structure, What are the most commo...

What are the most common schemes for defining the logical structure of a directory? The most common schemes for explaining the logical structure of a directory Single-L

Explain the various methods for handling deadlocks, Explain the various met...

Explain the various methods for handling deadlocks.      A set of processes is deadlocked if every process in the set is waiting for an event that only a process in the

Safety algorithm and resource request algorithm, Safety algorithm : This is...

Safety algorithm : This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd