Explain clustered file organization, Operating System

Assignment Help:

Clustered file organization

A clustered file is also called a B-tree-clustered file is a tree-structured file in which records with adjacent index values are clustered together to reduce the cost of searching for ranges of records. The SFS server voluntarily maintains the clustered file organization used in clustered SFS files.

Records in a clustered file don't have a numeric record index such as an ESN or RSN. The primary index is able to be based on any field or combination of fields and the records in a clustered file are ordered based on the contents of the primary index. Ever since the SFS server is able to move records to maintain clustering when new records are inserted or deleted there is no practical way to maintain direct references to individual records. The records in a clustered file are able to be fixed or variable in length. Records in clustered files are able to be updated or deleted. Disk space freed by means of record deletions is automatically reused. It works with blocks of data that are exchanged with disk or tape systems.

 

 


Related Discussions:- Explain clustered file organization

Illustrate scope of consumer behaviour, Q. Illustrate Scope of Consumer beh...

Q. Illustrate Scope of Consumer behaviour ? Scope of consumer behaviour is extremely wide due to following reasons: >>Ever rising intensifying competition. >>Additional a

Transfer time, A hard-disk drive reads “120 GB HDD 7200 rpm 3 GB/sec transf...

A hard-disk drive reads “120 GB HDD 7200 rpm 3 GB/sec transfer rate”. If the drive has a sector size of 512 bytes, what is the average rotational latency and transfer time to read

What is the sequence in which resources may be utilized, What is the sequen...

What is the sequence in which resources may be utilized? Under normal mode of operation, a process may utilize a resource in the following sequence: Request: If the requ

Define a election algorithm, Consider a setting where processors are not as...

Consider a setting where processors are not associated with unique identifiers but the total number of processors is known and the processors are organized along a bidirectional ri

Memory management, example of first fit best fit and worst fit

example of first fit best fit and worst fit

Bag of tasks, The producer-consumermodel above has a standard human analogy...

The producer-consumermodel above has a standard human analogy of an assembly line. Humans have specialized skills, however, whereas threads running the same program do not need to

Hashed page table, Hashed page tables A common approach for handling ad...

Hashed page tables A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elemen

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