%_Sequential retrieval on a primary key for sequential file storage ha – McqOptions

MCQOPTIONS

1.	%_Sequential retrieval on a primary key for sequential file storage has which of the following features?_%
A.	Very fast
B.	Moderately fast
C.	Slow
D.	Impractical
Answer» B. Moderately fast

Discussion

No Comment Found

Related MCQs

Distributing the columns of a table into several separate physical records is known as horizontal partitioning.~!
A bitmap index is an index on columns from two or more tables that come from the same domain of values.~!
It is usually not very important to design the physical database to minimize the time required by users to interact with the information systems.~!
A pointer is a detailed coding scheme recognized by system software for representing organizational data.%!
The primary goal of physical database design is data processing efficiency.%!
In general, larger block sizes are used for online transaction processing applications and smaller block sizes are used for databases with a decision support or data warehousing system.%!
Some advantages of partitioning include: efficiency, security, and load balancing.%!
Hashing algorithm converts a primary key value into a record address.%!
Data-volume and frequency-of-use statistics are not critical inputs to the physical database design process.%!
A field represents each component of a composite attribute.%!