Question
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
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?
View solution
Q. A secondary key is which of the following?
View solution
Q. The fastest read/write time and most efficient data storage of any disk array type is:
View solution
Q. Which of the following improves a query's processing time?
View solution
Q. The blocking factor is:
View solution
Q. Which of the following is not a relational database?
View solution
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
View solution
Q. A number of related records that are treated as a unit is called
View solution
Q. If you want to group the records in the abc database, you could use the Jobcode as the _____.
View solution
Q. Which of the following is not characteristic of a relational database model?
View solution
Q. A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields.
View solution
Q. A compound key
View solution
Q. If a piece of data is stored in two places in the database, then
View solution
Q. A relational database management (RDBM) package manages data in more than one file at once. How does it organize these file? As
View solution
Q. When the primary key is null of the new tuple then the constraint violated is
View solution
Q. In formal relational model, the set of indivisible values is called
View solution
Q. In relational model terminology, the table is considered as
View solution
Q. The key which specifies that two different tuples cannot have the same value is classified as
View solution
Q. The format or data type must be specified for
View solution
Q. In a relation schema, each key of schema having more than one key is classified as
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!