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

Fork system call in unix, Forking is an important phase of Unix, critical t...

Forking is an important phase of Unix, critical to the support of its design strategies, which encourages the implementation of filters. In Unix, a filter is a process that reads i

Dynamically linked segmentation system, Sharing segments between processes ...

Sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system. a. Define a system that permits sta

Explain three major components of page-fault service time, We are faced wit...

We are faced with three major components of the page-fault service time. 1. Service the page-fault interrupts. 2. Read in the page. 3. Restart the processes.

Explain process scheduling, Explain Process scheduling Process scheduli...

Explain Process scheduling Process scheduling consists of the subsequent sub-functions: 1.      Scheduling : Selects the process to be implement next on the CPU 2.      D

Compute minimum transfer size for acceptable utilization, Q. It is occasio...

Q. It is occasionally said that tape is a sequential-access medium whereas magnetic disk is a random-access medium. In fact the correctness of a storage device for random access d

Explain the benefits of thread over process?, BENEFITS OF THREADS OVER PROC...

BENEFITS OF THREADS OVER PROCESS If implemented correctly after those threads have some advantages of (multi) processes, they take: 1. Less time to create a new thread tha

Define unix device driver, Define UNIX device driver The UNIX device dr...

Define UNIX device driver The UNIX device driver is structured into two halves called top half and bottom half

Multilevel queue scheduling, Explain multilevel queue scheduling and multil...

Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#

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