Two basic constructs to link one piece of data with another piece of data: sequential storage and pointers. True False TRUE ANSWER : ? YOUR ANSWER : ?
Denormalization and clustering can work well to minimize data access time for small records. False True TRUE ANSWER : ? YOUR ANSWER : ?
Hashing algorithm converts a primary key value into a record address. False True TRUE ANSWER : ? YOUR ANSWER : ?
Data-volume and frequency-of-use statistics are not critical inputs to the physical database design process. True False TRUE ANSWER : ? YOUR ANSWER : ?
A rule of thumb for choosing indexes for a relational database includes which of the following? 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. Indexes are more useful on smaller tables. Do not specify a unique index for the primary key of each table. TRUE ANSWER : ? YOUR ANSWER : ?
The primary goal of physical database design is data processing efficiency. False True TRUE ANSWER : ? YOUR ANSWER : ?
If a denormalization situation exists with a one-to-one binary relationship, which of the following is true? 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. TRUE ANSWER : ? YOUR ANSWER : ?
Distributing the columns of a table into several separate physical records is known as horizontal partitioning. False True TRUE ANSWER : ? YOUR ANSWER : ?
A pointer is a detailed coding scheme recognized by system software for representing organizational data. False True TRUE ANSWER : ? YOUR ANSWER : ?