Physical Database Design Two basic constructs to link one piece of data with another piece of data: sequential storage and pointers. False True False True ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design Sequential retrieval on a primary key for sequential file storage has which of the following features? Very fast Moderately fast Impractical Slow Very fast Moderately fast Impractical Slow ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design Which of the following is an advantage of partitioning? Security Complexity Inconsistent access speed Extra space Security Complexity Inconsistent access speed Extra space 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 three relations. All fields are stored in one relation. All fields are stored in four relations. All fields are stored in two relations. All fields are stored in three relations. All fields are stored in one relation. All fields are stored in four relations. All fields are stored in two relations. ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design Hashing algorithm converts a primary key value into a record address. 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. Be careful indexing attributes that have null values. Do not specify a unique index for the primary key of each table. Indexes are more useful on smaller tables. Indexes are more useful for columns that do not appear frequently in the WHERE clause in queries. Be careful indexing attributes that have null values. Do not specify a unique index for the primary key of each table. Indexes are more useful on smaller tables. ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS