adplus-dvertising
frame-decoration

Question

The type of organization in which the records are inserted at the end of stored file is classified as

a.

pile file

b.

linear search file

c.

relative file

d.

external file

Posted under Indexing and Hashing DBMS

Answer: (a).pile file

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The type of organization in which the records are inserted at the end of stored file is classified as

Similar Questions

Discover Related MCQs

Q. The kind of field with which the record searching is done is classified as

Q. The hashing process if used for disk files is classified as

Q. The fields which are used to retrieve the related records from other files are called

Q. The command in DBMS software which is used to locate records that fulfills the search condition is classified as

Q. The number of values taken by hash field are called

Q. The index which has an entry for some of the key value is classified as

Q. The primary indexes, secondary indexes and cluster indexes are all types of

Q. In multilevel indexes, the primary index created for its first level is classified as

Q. The indexes which specifies address of records on disk with a physical pointer are classified as

Q. The example of non dense index is

Q. In the data file, the first record of any of the block is called

Q. The file which has secondary index for its every field is classified as

Q. The first field in the primary index having same data type as in the ordering field is considered as

Q. In multilevel indexes, the primary index created for its second level is classified as

Q. The kind of index which is based on any candidate key or a non key field which may have duplicate values is classified as

Q. In multilevel indexes, the blocking factor is also called

Q. The index which has an entry for every key value is classified as

Q. The special node in the tree structure which has many child nodes and one parent node is called

Q. The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as

Q. The type of multilevel index which leaves space for inserting new entries in its blocks is called