Multiple Choice
Consider Table A on the "one side" of a one-to-many relationship and Table B on the "many side" of the relationship. The "repeating groups" in Table B may be considered for merging into the related records of Table A if ____.
A) there is a large number of occurrences of the repeating groups of Table B for each record of Table A
B) there is a small number of occurrences of the repeating groups of Table B for each record of Table A
C) there is a significant number of indexes built over the repeating groups of Table B
D) All of the above.
E) None of the above.
Correct Answer:

Verified
Correct Answer:
Verified
Q18: All of the following are good candidates
Q19: In terms of performance, there is no
Q20: Each entry in a simple linear index
Q21: Using the clustered files technique involves reorganizing
Q22: An index can be built over a
Q24: The physical design technique known as "substituting
Q25: Programs and data are loaded into primary
Q26: All of the following are true about
Q27: In the division remainder hashing algorithm, the
Q28: In a hashed file, a collision occurs