Describe sequential file organization, Database Management System

Assignment Help:

Describe sequential file organization.  Explain the rules for

(i)  Inserting a new record.

(ii)  Deleting an existing record.       

 Ans:A sequential file consists of records organized by the order in which they were entered. The order of the records is fixed.

Records in sequential files can be written or read just sequentially.

After you placed a record into a sequential file, you cannot lengthen, shorten, or delete the record. Though, you can update (REWRITE) a record if the length does not alter. New records are added at the end of the file.

If the order in which you maintain records in a file is not significant, sequential organization is a good choice if there are many records or only a few. Sequential output is as well useful for printing reports.

(i) Inserting a new record:  Insertion poses problems if no space in which new record should go. If space, use it, if not then put new record in an overflow block.

(ii) Deleting an existing record: Deletion can be managed along with the pointer chains


Related Discussions:- Describe sequential file organization

Multivalued attributes, For every multivalued attribute 'A', we make a new ...

For every multivalued attribute 'A', we make a new relation R that contains an attribute corresponding to plus the primary key attribute k of the relation that shows the entity typ

Explain the outer join, Define Outer join Outer join - If there are any...

Define Outer join Outer join - If there are any type of values in the one table that do not have corresponding value(s) in the other, in an equi-join which will not be selected

Textbook ordering system, Question: Consider the following database rel...

Question: Consider the following database relations for a textbook ordering system used by a college bookshop: Book (b-copy#, bname, ISBN#, author, price, subject) Order (s#

Differentiate between b-tree and b+ tree, Differentiate between B-tree and ...

Differentiate between B-tree and B + tree    Ans:  A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

E-R MODEL, WHAT IS MEANT BY E-R MODEL

WHAT IS MEANT BY E-R MODEL

What is an object design, What is an object design? Object design is a ...

What is an object design? Object design is a very interactive method, which decides the relationship among objects, classifies operations on classes, determines overall system

Describe the composite key, Describe the Composite Key Composite Key: ...

Describe the Composite Key Composite Key: Sometimes one key is not enough to uniquely recognize a row. E.g. in a single class Roll is enough to search a student, but in the w

What are the causes of bucket overflow in a hash file, What are the causes ...

What are the causes of bucket overflow in a hash file organization? What can be done to reduce the occurrence of bucket overflow? When a record is inserted, the bucket to that

Determine the strong and weak entity, Determine the Strong and Weak Entity ...

Determine the Strong and Weak Entity Based on the method of foreign key, there might be arise a situation when we have to relate an entity having a primary key of its own and a

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