adplus-dvertising
frame-decoration

Question

A rule of thumb for choosing indexes for a relational database includes which of the following?

a.

Indexes are more useful on smaller tables.

b.

Indexes are more useful for columns that do not appear frequently in the WHERE clause in queries.

c.

Do not specify a unique index for the primary key of each table.

d.

Be careful indexing attributes that have null values.

Posted under DBMS

Answer: (d).Be careful indexing attributes that have null values.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A rule of thumb for choosing indexes for a relational database includes which of the following?

Similar Questions

Discover Related MCQs

Q. Which of the following are integrity controls that a DBMS may support?

Q. A secondary key is which of the following?

Q. The fastest read/write time and most efficient data storage of any disk array type is:

Q. Which of the following improves a query's processing time?

Q. The blocking factor is:

Q. Which of the following is not a relational database?

Q. A list consists of last names, first names, addresses, and pin codes if all people in the list have the same last and the same pin code, a useful key would be

Q. A number of related records that are treated as a unit is called

Q. If you want to group the records in the abc database, you could use the Jobcode as the _____.

Q. Which of the following is not characteristic of a relational database model?

Q. A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields.

Q. A compound key

Q. If a piece of data is stored in two places in the database, then

Q. A relational database management (RDBM) package manages data in more than one file at once. How does it organize these file? As

Q. When the primary key is null of the new tuple then the constraint violated is

Q. In formal relational model, the set of indivisible values is called

Q. In relational model terminology, the table is considered as

Q. The key which specifies that two different tuples cannot have the same value is classified as

Q. The format or data type must be specified for

Q. In a relation schema, each key of schema having more than one key is classified as