Physical Database Design Sequential retrieval on a primary key for sequential file storage has which of the following features? Slow Very fast Moderately fast Impractical Slow Very fast Moderately fast 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 A pointer is a detailed coding scheme recognized by system software for representing organizational data. True False True False 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. Indexes are more useful on smaller tables. 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 for columns that do not appear frequently in the WHERE clause in queries. Indexes are more useful on smaller tables. Be careful indexing attributes that have null values. Do not specify a unique index for the primary key of each table. ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design Which of the following are integrity controls that a DBMS may support? Limit the set of permissible values that a field may assume. All of these Limit the use of null values in some fields. Assume a default value in a field unless a user enters a value for that field. Limit the set of permissible values that a field may assume. All of these Limit the use of null values in some fields. Assume a default value in a field unless a user enters a value for that field. ANSWER DOWNLOAD EXAMIANS APP
Physical Database Design If a denormalization situation exists with a many-to-many or associative binary relationship, which of the following is true? All fields are stored in three relations. All fields are stored in four relations. All fields are stored in one relation. All fields are stored in two relations. All fields are stored in three relations. All fields are stored in four relations. All fields are stored in one relation. All fields are stored in two relations. ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS