adplus-dvertising
frame-decoration

Question

If you want to organize a file in multiple ways, it is better to _____ the data rather than to sort it.

a.

Delete

b.

Update

c.

Sort Key

d.

Index

Posted under DBMS

Answer: (d).Index

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If you want to organize a file in multiple ways, it is better to _____ the data rather than to sort it.
Bliss : June 26, 2023

Good

Similar Questions

Discover Related MCQs

Q. The physical location of a record is determined by a mathematical formula that transforms a file key into a record location in

Q. The master list of an indexed file

Q. The files used for speedy disk search by providing the specialized structures of data are classified as

Q. In database management system, the types of data structures used in indexes are

Q. In linear hashing, the formula of file load factor is

Q. The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as

Q. The hashing technique which allocates fixed number of buckets is classified as

Q. The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as

Q. In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

Q. The type of data organization which does not allow cross block boundaries is called

Q. If the global depth is more than local depth then the operation must be performed in directory array is

Q. In extendible hashing array of bucket addresses 2d then d is considered as

Q. The open addressing, multiple hashing and chaining are all the methods used for

Q. The record searching technique which is based on the blocks rather than records is called

Q. The additional access path added into ordered file is called

Q. The hash functions that does not maintain order of values of hash field are called

Q. The kind of hashing technique in which a directory of having addresses 2d is maintained is called

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

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