adplus-dvertising
frame-decoration

Question

Indexes which specifies address of records on disk with a physical pointer are classified as

a.

structural index

b.

hashing index

c.

physical index

d.

logical index

Posted under DBMS

Answer: (c).physical index

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. Example of non dense index is

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

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

Q. First field in primary index having same data type as in ordering field is considered as

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

Q. The method of access which uses key transformation is known as

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

Q. An indexing operation

Q. The index consists of

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

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