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

Explain operating systems for mainframe computers, What are the main differ...

What are the main differences between operating systems for mainframe computers and personal computers? The design goals of operating systems for those machines are quite diffe

What is critical section problem, What is critical section problem? Con...

What is critical section problem? Consider a system consists of 'n' processes. Every process has segment of code called a critical section, in which the process might be changi

Explain page-replacement algorithms, Q. Consider the following page-replac...

Q. Consider the following page-replacement algorithms. Rank the algorithms on a five-point scale from "bad" to "perfect" according to their page-fault rate. Detach those algorithm

Define lazy swapper, Define lazy swapper. Rather than swapping the enti...

Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne

Define paging , Paging: Only the needed memory pages are moved to main me...

Paging: Only the needed memory pages are moved to main memory from the swap machine for execution. Process size does not matter. Produce the concept of the virtual memory. It

Nested Macro calls, . Nested Macro calls are expanded using the

. Nested Macro calls are expanded using the

How can application use memory via the win32 api, Q. Explain some of the wa...

Q. Explain some of the ways an application can use memory via the Win32 API. Answer: (1) Virtual memory offers several functions that allow an application to reserve and rele

System bus and device speeds as the cpu speed increases, Q. Why is it impor...

Q. Why is it important to scale up system bus and device speeds as the CPU speed increases? Answer: Consider a system which carries out 50% I/O and 50% computes. Doubling-up

Single-level page table, Consider a computer system with a 32-bit logical a...

Consider a computer system with a 32-bit logical address and 4KB page size. The system supports up to 512MB of physical memory. How many entries are there in a conventional single-

Does windows xp offer any user-mode processes, Q. Does Windows XP offer any...

Q. Does Windows XP offer any user-mode processes that enable it to run programs developed for other operating systems? Describe two of these subsystems. Answer: Environmental

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