Explain the entry-sequenced file organization, Operating System

Assignment Help:

Entry-sequenced file organization

The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to the end of the file. When records are removed from an entry-sequenced file the space formerly allocated to those records is not automatically reclaimed or reused. The only means to reclaim this space is by using the sfs_ReorganizeFile function. Entry-sequenced files are often used when records in the file will be accessed in the order that they are written to the file. This type of file organization is frequently used for log files, audit trail files, or for any other files that keep time-sequenced records of events.

Entry-sequenced files are able to contain fixed-length or variable-length records. When an existing record is updated then the updated record must be no longer than the original record. Every record in an entry-sequenced file has an entry sequence number (ESN) which are corresponds to the order in which it was inserted into the file. The ESN isn't part of the record, and is therefore said to be implicit. Because the value of the primary index key for entry-sequenced files isn't part of the record, merely the name of the primary index must be specified when creating an entry-sequenced file in SFS. It isn't necessary to supply names of fields on which to base the index.

When records are read by an entry-sequenced file a sequential scan on the primary index (ESN) for the file returns records in the order in which they were inserted regardless of whether they have subsequently been updated. Records that have been deleted don't show up when an entry-sequenced file is scanned.


Related Discussions:- Explain the entry-sequenced 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

Use of the computing hardware, Q. We have stressed the require for an oper...

Q. We have stressed the require for an operating system to make efficient use of the computing hardware. When is it suitable for the operating system to forsake this principle and

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Describe the buddy system of memory allocation, Buddy system of memory allo...

Buddy system of memory allocation Free memory is used to maintain in linked lists, each of similar sized blocks. Every block is of size 2^k. When some memory is needed by a th

Explain disk scheduling algorithms-shortest seek time first, SSTF (Shortest...

SSTF (Shortest Seek Time First) After a demand go to the closest request in the work queue regardless of direction Decrease total seek time compared to FCFS Disadv

Why we need to use a while statement when using wait method, Q. The wait()...

Q. The wait() statement in every Java program examples was part of a while loop. Describe why you would always need to use a while statement when using wait() and why you would ne

Need of shift alteration in critical section problem?, Explain with an exam...

Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .

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