Physical Database Design Sequential retrieval on a primary key for sequential file storage has which of the following features? Very fast Moderately fast Slow Impractical Very fast Moderately fast Slow Impractical 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 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. False True False True ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design A secondary key is which of the following? Useful for denormalization decisions Nonunique key Primary key Determines the tablespace required Useful for denormalization decisions Nonunique key Primary key Determines the tablespace required ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design The three newest database architectures in use today are relational, multidimensional and hierarchical. False True False True ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design A rule of thumb for choosing indexes for a relational database includes which of the following? Indexes are more useful for columns that do not appear frequently in the WHERE clause in queries. Do not specify a unique index for the primary key of each table. Indexes are more useful on smaller tables. Be careful indexing attributes that have null values. Indexes are more useful for columns that do not appear frequently in the WHERE clause in queries. Do not specify a unique index for the primary key of each table. Indexes are more useful on smaller tables. Be careful indexing attributes that have null values. ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS