1. Using the division remainder algorithm for a hashed file _____. a.

the record
insertion location is based on the division s remainder
2. The drawback of denormalization is that it ____. B. introduces data redundancy
3. Horizontal partitioning ____. a. means dividing the rows of a table into groups and
storing the groups separately, on different areas of a disk or on different disks
4. The common advantage of separating portions of a table s data using either
horizontal or vertical partitioning is that ____. c. the data in a partition can be
stored in a concentrated space on the disk, which will speed up its retrieval
5. Physical database design is necessary ____. c. to improve the performance of the
run-time environment.
6. The advantage of using the substituting foreign keys physical database design
technique is that it is designed to ____. a. reduce the number of joins
7. Application data requirements that enter into the physical database design
process include ____. d. All of the above
8. All of the following are factors affecting application and database performance,
except ____. a. the length of attribute names
9. Consider Table A on the one side of a one-to-many relationship and Table B on
the many side of the relationship. The primary key of Table A has been placed in
Table B as a foreign key. The substituting foreign keys physical database design
technique ____. c. can only be performed if Table A has more than one candidate
key
10. A logical view is an important device in ____. c. protecting the security of the data
11. Consider Table A on the one side of a one-to-many relationship and Table B on
the many side of the relationship. In the storing derived data physical database
design technique, the best place to store the derived data from Table B is ____.
a. in a new column in Table A
12. In a magnetic disk device, the reason for storing data on a cylinder-wise basis is
_____. c. to minimize access arm movement in order to improve performance
13. In a hashed file using the division remainder method _____. b. a collision results
from the key values of two records having the same remainder in the hashing calculation
14. An access method is _____. a. the way that data is retrieved based on the file
organization in use

15. The creating a new primary key physical database design technique is designed
to ____. c. replace clumsy keys that have a large number of attributes
16. In a magnetic disk device, the number of positions to which the access arm
mechanism can move is equal to the number of _____. b. tracks on a recording
surface

17. Which of the following is true regarding indexed sequential files and B+-trees? a. A B+tree indexed file is an indexed sequential file
18. The most common data indexing system in use today is the _____. c. B+-tree
index
19. All of the following are steps in finding and transferring data from disk, except a b c

20. Taking application priorities into account in physical database design is important
because ____. A . a modification to a table that s designed to help the performance of
one application may hinder the performance of another application

21. 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 ____. b. there is a
small number of occurrences of the repeating groups of Table B for each record of Table A

22. The frequency with which stored data is updated is known as ____. a
23. Which of the following is true about indexes, in general? c. An index can be used to
retrieve the records of a file in logical sequence based on the indexed field.
24. In an indexed sequential file _____. b. the field on which the file is sequenced must be
indexed
25. Combining two tables that represent a one-to-one relationship ____. a. is designed
to reduce the number of joins in the database environment

26. All of the following are characteristics of an indexed computer file and its index,
except _____. a. the records of the file are sorted into the same order as the values in the
index

27. The clustering files physical database design technique ____. a. is designed to
improve the performance of a join operation

28. In terms of time, rotational delay in a disk device takes on average roughly
_____. c. one half of a revolution
29. Consider Table A on the one side of a one-to-many relationship and Table B on
the many side of the relationship.
30. Denormalization can improve the ____. a. performance of the database by reducing
the number of join operations

31. In a magnetic disk device, a single circle of stored data is called a _____. a. track
32. All of the following are advantages of the B+-tree index arrangement, compared
to the simple linear index arrangement, except _____. b. The insertion of a new
record requires either a track split or a cylinder split, but not both for a single insertion

33. The delay from the time that the Enter Key is pressed to execute a query until the
result appears on the screen is called ____. a. response time
34. In terms of performance, there is no point in indexing a table if ____. c. the
number of rows of the table is very small
35. All of the following are true about B+-tree indexes and their files, except _____.
e. A cylinder split must lead to an increase in the number of levels of the index tree
36. Hashed files _____. d. can also have indexes built over them
37. In a magnetic disk device, a set of tracks, one above the other (and one from
each recording surface) is called a _____. a
38. All of the following are inputs into the physical database design process, except
____. A b
39. All of the following are true about secondary memory devices, except _____.a b
cd
40. Vertical partitioning ____. A b
41. In a magnetic disk device, the number of tracks in a cylinder is equal to the
number of _____. c. recording surfaces
42. In the division remainder hashing algorithm, the divisor (the number divided into
the other number) is _____. A b c
43. The starting point of the physical database design process is ____. A b c d
44. Which of the following is a potential problem caused by adding too many indexes
to a relational database? A b c
45. The storing derived data physical database design technique is designed to
____. A b c

46. Denormalization ____. a

47. In a hashed file, synonym pointer chains _____. A b c
48. Direct access can be achieved _____. A b c
49. All of the following are advantages of the B+-tree index arrangement, compared to the
simple linear index arrangement, except________. A

50. In the clustering files physical database design technique, ____ are clustered
near each other on a disk. A b c
51. Which of the following is true regarding hashed files? A b
52. All of the following are factors affecting application and database performance,
except ____. A b
53.
54. Consider Table A on the one side of a one-to-many relationship and Table B on
the many side of the relationship. Denormalization ____. a
55. In the adding new tables physical database design technique ____. A b
56. All of the following are good candidates for having an index built over them,
except ____. A b
57. If the primary key of a table is clumsy because it has too many attributes and is
replaced by a new, single attribute key, ____. d. All of the above.
58.