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

Disk scheduling algorithms-first come, FCFS (First Come, First Served) Per...

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

What are scheduling queues?, What are scheduling queues? Since the proc...

What are scheduling queues? Since the processes enter the system they are put into job queue. This queue contains all processes in the system. The processes that are exist in m

Thread pools, Another solution then would be to keep a pool of threads. Whe...

Another solution then would be to keep a pool of threads. Whenever a new task arrives, the system would simply get a thread from pool and set that thread to work on the given task.

Characteristics of suspend process, Characteristics of suspend process ...

Characteristics of suspend process Suspended process isn't immediately available for execution. The process may or may not be waiting on an event. For preventing t

What are a safe state and an unsafe state, What are a safe state and an uns...

What are a safe state and an unsafe state? Answer:  A state is safe if the system can allocate resources to every process in some order and still avoid a deadlock. A system is

Do ratio analysis of financial statements, Do ratio analysis by comparing t...

Do ratio analysis by comparing the four companies financial statements, analysis and interpretation on the four-basic group : (Refer to attachment A) Liquidity ratio Asset

Demand paging, Demand paging gives that pages could only be brought into ...

Demand paging gives that pages could only be brought into memory if the running process acts them. This is usually referred to as lazy evaluation as only those pages operated by

What is meant by arm-stickiness, What is meant by arm-stickiness? If on...

What is meant by arm-stickiness? If one or a few processes have a high access rate to data on single track of a storage disk, then they might be monopolizing the device by repe

Explain deadlock prevention, Deadlock Prevention Prevention is the name...

Deadlock Prevention Prevention is the name given to method that guarantee that deadlocks can never happen for the reason that the way the system is structured. Since 4 conditio

Least-recently used, LRU evicts the page which was last accessed the farthe...

LRU evicts the page which was last accessed the farthest into the past of any page resident in physical memory, i.e. the least-recently used page. LRU approximates OPT when the rec

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