Physical Database Design Sequential retrieval on a primary key for sequential file storage has which of the following features? Slow Moderately fast Impractical Very fast Slow Moderately fast Impractical Very fast ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design Hashing algorithm converts a primary key value into a record address. True False True False ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design A secondary key is which of the following? Nonunique key Primary key Useful for denormalization decisions Determines the tablespace required Nonunique key Primary key Useful for denormalization decisions Determines the tablespace required ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design If a denormalization situation exists with a one-to-one binary relationship, which of the following is true? All fields are stored in four relations. All fields are stored in two relations. All fields are stored in one relation. All fields are stored in three relations. All fields are stored in four relations. All fields are stored in two relations. All fields are stored in one relation. All fields are stored in three relations. ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design An extent is a contiguous section of disk storage space. False True False True ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design It is usually not very important to design the physical database to minimize the time required by users to interact with the information systems. True False True False ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS