Exam 8: Physical Database Design

arrow
  • Select Tags
search iconSearch Question
  • Select Tags

A "fixed" or "hard" disk drive operates with removable diskettes.

(True/False)
4.8/5
(36)

If the primary key of a table is clumsy because it has too many attributes and is replaced by a new, single attribute key, ____.

(Multiple Choice)
4.7/5
(46)

All of the following are advantages of the B+-tree index arrangement, compared to the simple linear index arrangement, except _____.

(Multiple Choice)
4.8/5
(36)

Denormalization improves the performance of join operations at the expense of reintroducing data redundancy.

(True/False)
4.9/5
(47)

In the B+-tree index arrangement described in the text, the lowest level of the index tree is stored using a track in each data cylinder.

(True/False)
4.9/5
(30)

Clustering files disperses logically related data from two tables to different parts of the disk.

(True/False)
4.8/5
(35)

Construct a B+-tree index of the type discussed in the text for the Animal file, assuming that now there are many more records than are shown above . The file and the index have the following characteristics: -The file is stored on eight cylinders of the disk. The highest key values on the eight cylinders, in order, are: Cylinder 1: 03583 Cylinder 2: 08437 Cylinder 3: 18965 Cylinder 4: 27028 Cylinder 5: 41603 Cylinder 6: 53781 Cylinder 7: 68337 Cylinder 8: 80174 -Each index record can hold four key value/pointer pairs. -There are three index records at the lowest level of the tree index.

(Essay)
4.7/5
(44)

A hashed file has space for 80 records. Relative record numbers of 0-79 label each of the 80 record positions. In addition, there is space for several overflow (synonym) records. Draw a picture of the file and using the division-remainder method, store records with each of the following five digit keys, accounting for collisions as necessary: a. 27043. b. 36235. c. 06003. d. 40963.

(Essay)
4.8/5
(39)

In addition to its direct access capability, an index can be used to retrieve the records of a file in logical sequence based on the indexed field.

(True/False)
4.8/5
(38)

Construct a B+-tree index of the type discussed in the text for the Animal file, assuming that now there are many more records than are shown above. The file and the index have the following characteristics: -The file is stored on eight cylinders of the disk. The highest key values on the eight cylinders, in order, are: Cylinder 1: 03583 Cylinder 2: 08437 Cylinder 3: 18965 Cylinder 4: 27028 Cylinder 5: 41603 Cylinder 6: 53781 Cylinder 7: 68337 Cylinder 8: 80174 -Each index record can hold two key value/pointer pairs. -There are four index records at the lowest level of the tree index.

(Essay)
4.7/5
(41)

If a file is hashed on one field, direct access based on another field can be achieved by building an index on the other field.

(True/False)
4.8/5
(37)

Creating views actually changes the logical database design.

(True/False)
5.0/5
(41)

The starting point of the physical database design process is ____.

(Multiple Choice)
4.8/5
(35)

The more volatile the data in a table, the less will be the negative performance effect of having a relatively large number of indexes built over it.

(True/False)
4.8/5
(40)

Some physical database design techniques actually change the logical design while others do not.

(True/False)
4.9/5
(37)

The way that data is retrieved, based on it being stored with a particular access method, is called its file organization.

(True/False)
4.9/5
(32)

Factors in the applications that use databases can affect database performance.

(True/False)
4.8/5
(42)

In a magnetic disk device, the number of tracks in a cylinder is equal to the number of _____.

(Multiple Choice)
4.8/5
(43)

One of the advantages of B+-tree indexes is that they can handle record insertions more easily than simple linear indexes.

(True/False)
4.9/5
(39)

Hashed files _____.

(Multiple Choice)
4.9/5
(41)
Showing 101 - 120 of 134
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)