\(\begin{array}{lllll} \begin{array}{lll} \text { Course } \quad\quad \text { Record }\\ \text { Name } \quad \quad \text { Address }\\ \begin{array}{|l|l|} \hline \text { Anatomy } & 2 \\ \hline \text { Biology I } & 1 \\ \hline \text { Calculus I } & 4 \\ \hline \text { Shakespeare } & 3 \\ \hline \text { Statistics II } & 5 \\ \hline \end{array}\\\text { Index }\end{array} &\begin{array}{lllll}\text { Record }&\text { Course\quad\quad\quad Course\quad\quad\quad\quad Number of\quad Professor }\\ \text { Number }&\text { Number\quad\quad\quad Name\quad\quad\quad\quad Credits\quad\quad in Charge }\\ \begin{array}{lr} 1\\2\\3\\4\\5 \end{array}&\begin{array}{|l|l|l|l|} \hline \text { BIOL1001 } & \text { Biology I } & 4 \quad\quad\quad& \text { Smith } \\ \hline \text { BIOL3020 } & \text { Anatomy } & 3 & \text { Jones } \\ \hline \text { ENGL2540 } & \text { Shakespeare } & 3 & \text { Duncan } \\ \hline \text { MATH2000 } & \text { Calculus I } & 4 & \text { Stevens } \\ \hline \text { MATH3500 } & \text { Statistics II } & 3 & \text { Jones } \\ \hline\end{array}\\ \end{array}\end{array}\) -The Course file and its index _____.

A) is an indexed-sequential file because the index is in sequence by Course Name B) is an indexed sequential file because the index and the file are each in sequence by some field C) is an indexed sequential file because an index is built over one of the file's fields D) is not an indexed sequential file because the indexed field is not the one on which the file is sequenced E) is not an indexed sequential file because only one of the file's fields is indexed A) is an indexed-sequential file because the index is in sequence by Course Name B) is an indexed sequential file because the index and the file are each in sequence by some field C) is an indexed sequential file because an index is built over one of the file's fields D) is not an indexed sequential file because the indexed field is not the one on which the file is sequenced E) is not an indexed sequential file because only one of the file's fields is indexed

\(\begin{array}{lllll} \begin{array}{lll} \text { Course } \quad\quad \text { Record }\\ \text { Name } \quad \quad \text { Address }\\ \begin{array}{|l|l|} \hline \text { Anatomy } & 2 \\ \hline \text { Biology I } & 1 \\ \hline \text { Calculus I } & 4 \\ \hline \text { Shakespeare } & 3 \\ \hline \text { Statistics II } & 5 \\ \hline \end{array}\\\text { Index }\end{array} &\begin{array}{lllll}\text { Record }&\text { Course\quad\quad\quad Course\quad\quad\quad\quad Number of\quad Professor }\\ \text { Number }&\text { Number\quad\quad\quad Name\quad\quad\quad\quad Credits\quad\quad in Charge }\\ \begin{array}{lr} 1\\2\\3\\4\\5 \end{array}&\begin{array}{|l|l|l|l|} \hline \text { BIOL1001 } & \text { Biology I } & 4 \quad\quad\quad& \text { Smith } \\ \hline \text { BIOL3020 } & \text { Anatomy } & 3 & \text { Jones } \\ \hline \text { ENGL2540 } & \text { Shakespeare } & 3 & \text { Duncan } \\ \hline \text { MATH2000 } & \text { Calculus I } & 4 & \text { Stevens } \\ \hline \text { MATH3500 } & \text { Statistics II } & 3 & \text { Jones } \\ \hline\end{array}\\ \end{array}\end{array}\) -Which of the following is true regarding the Course file and its index?

A) The index shown is the only index that can be built over this file. B) The Professor in Charge field cannot be indexed because it is not unique. C) Because the Course Name field is indexed, the Course file should be sorted so that it is in order by Course Name. D) The Number of Credits field cannot be indexed because it has only two values. E) The Course Name field in the index must be in sorted order. A) The index shown is the only index that can be built over this file. B) The Professor in Charge field cannot be indexed because it is not unique. C) Because the Course Name field is indexed, the Course file should be sorted so that it is in order by Course Name. D) The Number of Credits field cannot be indexed because it has only two values. E) The Course Name field in the index must be in sorted order.

Consider the following relational database for the Central Zoo. Central Zoo wants to maintain information about its animals, the enclosures in which they live, and its zookeepers and the services they perform for the animals. In addition, Central Zoo has a program by which people can be sponsor of animals. Central Zoo wants to track its sponsors, their dependents, and associated data. Each animal has a unique animal number and each enclosure has a unique enclosure number. An animal can live in only one enclosure. An enclosure can have several animals in it or it can be currently empty. A zookeeper has a unique employee number. Every animal has been cared for by at least one and generally many zookeepers; each zookeeper has cared for at least one and generally many animals. Each time a zookeeper performs a specific, significant service for an animal the service type, date, and time are recorded. A zookeeper may perform a particular service on a particular animal more than once on a given day. A sponsor, who has a unique sponsor number and a unique social security number, sponsors at least one and possibly several animals. An animal may have several sponsors or none. For each animal that a particular sponsor sponsors, the zoo wants to track the annual sponsorship contribution and renewal date. In addition, Central Zoo wants to keep track of each sponsor's dependents. A sponsor may have several dependents or none. A dependent is associated with exactly one sponsor. \[\begin{array} { | l | l | l | l | l |} \hline \text { Enclosure } & & & \text { Date } \\ \text { Number } & \text { Type } & \text { Location } & \text { Size } & \text { Built } \\ \hline \end{array}\] ENCLOSURE Relation \[\begin{array} { | l | l | l | l | l | l | l | } \hline \text { Animal } & & \text { Animal } & & \text { Country } &&\text { Enclosure }\\ \text { Number } & \text { Species } & \text { Name } & \text { Gender } & \text { Of Birth } &\text { Weight }&\text { Number } \\ \hline \end{array}\] ANIMAL Relation \[\begin{array} { | l | l | l | l | } \hline \text { Employee } & \text { Employee } & & \text { Year } \\ \text { Number } & \text { Name } & \text { Title } & \text { Hired }\\ \hline \end{array}\] ZOOKEEPER Relation \[\begin{array} { | l | l | l | l | l |} \hline\text { Animal } & \text { Employee } & \text { Service } & & \\ \text { Number } & \text { Number } & \text { Type } & \text { Date } & \text { Time }\\ \hline \end{array}\] CARES FOR Relation \[\begin{array} { | l | l | l | l | l |} \hline \text { Sponsor } & \text { Social Security } & \text { Sponsor } & & \\ \text { Number } & \text { Number } & \text { Name } & \text { Address } & \text { Telephone }\\ \hline \end{array}\] SPONSOR Relation \[\begin{array} { | l | l | l | l | } \hline \text { Animal } & \text { Sponsor } & \text { Annual } & \text { Renewal } \\ \text { Number } & \text { Number } & \text { Contribution } & \text { Date } \\ \hline \end{array}\] CONTRIBUTION Relation \[\begin{array} { | l | l | l | l | } \hline \text { Sponsor } & \text { Dependent } & & \text { Date of } \\ \text { Number } & \text { Name } & \text { Relationship } & \text { Birth }\\ \hline \end{array}\] DEPENDENT Relation Analyze each of the following situations and, using physical database design techniques, state how you would modify the logical design shown to improve performance or otherwise accommodate it. a. There is a frequent need to find the total amount of annual contributions expected for each animal from all of each animals' sponsors. b. There is a high priority need to quickly find the information about the contributions for each animal together with the social security numbers of the sponsors. The sponsor numbers are not required in this query. c. There is a critical need to quickly list the animals that were born in a particular country. d. There is a frequent need to be able to retrieve detailed information about an animal together with detiled information about the enclosure in which it is housed. e. There is a much more frequent and high priority need to access the records for the monkeys than for the other animals. f. Due to large numbers of access activity, the ANIMAL relation has become a bottleneck.

a. This is a case for storing derived da

Exam 8: Physical Database Design

A fixed disk consists of five platters. Both surfaces of each of the five platters is used to record data. There are 75 tracks on each recording surface. How many of each of the following are there in the disk: a. Recording surfaces? b. Cylinders? c. Tracks per cylinder?

(Essay)

4.8/5

(30)

Question 121

One of the main advantages of a hashed file is that it never has to be reorganized.

(True/False)

4.7/5

(41)

Question 122

Course Record Name Address Anatomy 2 Biology I 1 Calculus I 4 Shakespeare 3 Statistics II 5 Index Record CourseCourseNumber ofProfessor Number NumberNameCreditsin Charge 1 2 3 4 5 BIOL1001 Biology I 4 Smith BIOL3020 Anatomy 3 Jones ENGL2540 Shakespeare 3 Duncan MATH2000 Calculus I 4 Stevens MATH3500 Statistics II 3 Jones -The Course file and its index _____.

(Multiple Choice)

4.9/5

(41)

Question 123

In a magnetic disk device, a single circle of stored data is called a _____.

(Multiple Choice)

4.8/5

(39)

Question 124

Course Record Name Address Anatomy 2 Biology I 1 Calculus I 4 Shakespeare 3 Statistics II 5 Index Record CourseCourseNumber ofProfessor Number NumberNameCreditsin Charge 1 2 3 4 5 BIOL1001 Biology I 4 Smith BIOL3020 Anatomy 3 Jones ENGL2540 Shakespeare 3 Duncan MATH2000 Calculus I 4 Stevens MATH3500 Statistics II 3 Jones -Which of the following is true regarding the Course file and its index?

(Multiple Choice)

4.7/5

(34)

Question 125

Retrieval performance of a B+-tree indexed file can be improved by keeping the upper part of the index tree resident in main memory.

(True/False)

4.9/5

(35)

Question 126

The delay from the time that the Enter Key is pressed to execute a query until the result appears on the screen is called ____.

(Multiple Choice)

4.8/5

(33)

Question 127

The number of levels in a B+-tree index is permanently fixed at the time the file is created.

(True/False)

4.7/5

(40)

Question 128

Consider the following relational database for the Central Zoo. Central Zoo wants to maintain information about its animals, the enclosures in which they live, and its zookeepers and the services they perform for the animals. In addition, Central Zoo has a program by which people can be sponsor of animals. Central Zoo wants to track its sponsors, their dependents, and associated data. Each animal has a unique animal number and each enclosure has a unique enclosure number. An animal can live in only one enclosure. An enclosure can have several animals in it or it can be currently empty. A zookeeper has a unique employee number. Every animal has been cared for by at least one and generally many zookeepers; each zookeeper has cared for at least one and generally many animals. Each time a zookeeper performs a specific, significant service for an animal the service type, date, and time are recorded. A zookeeper may perform a particular service on a particular animal more than once on a given day. A sponsor, who has a unique sponsor number and a unique social security number, sponsors at least one and possibly several animals. An animal may have several sponsors or none. For each animal that a particular sponsor sponsors, the zoo wants to track the annual sponsorship contribution and renewal date. In addition, Central Zoo wants to keep track of each sponsor's dependents. A sponsor may have several dependents or none. A dependent is associated with exactly one sponsor. Enclosure Date Number Type Location Size Built ENCLOSURE Relation Animal Animal Country Enclosure Number Species Name Gender Of Birth Weight Number ANIMAL Relation Employee Employee Year Number Name Title Hired ZOOKEEPER Relation Animal Employee Service Number Number Type Date Time CARES FOR Relation Sponsor Social Security Sponsor Number Number Name Address Telephone SPONSOR Relation Animal Sponsor Annual Renewal Number Number Contribution Date CONTRIBUTION Relation Sponsor Dependent Date of Number Name Relationship Birth DEPENDENT Relation Analyze each of the following situations and, using physical database design techniques, state how you would modify the logical design shown to improve performance or otherwise accommodate it. a. There is a frequent need to find the total amount of annual contributions expected for each animal from all of each animals' sponsors. b. There is a high priority need to quickly find the information about the contributions for each animal together with the social security numbers of the sponsors. The sponsor numbers are not required in this query. c. There is a critical need to quickly list the animals that were born in a particular country. d. There is a frequent need to be able to retrieve detailed information about an animal together with detiled information about the enclosure in which it is housed. e. There is a much more frequent and high priority need to access the records for the monkeys than for the other animals. f. Due to large numbers of access activity, the ANIMAL relation has become a bottleneck.

(Essay)

4.9/5

(32)

Question 129

An access method is _____.

(Multiple Choice)

4.7/5

(32)

Question 130

Construct a B+-tree index of the type discussed in the text for the Airplane 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 six cylinders of the disk. The highest key values on the six cylinders, in order, are: Cylinder 1: 08574 Cylinder 2: 12740 Cylinder 3: 19025 Cylinder 4: 24859 Cylinder 5: 31745 Cylinder 6: 42853 -Each index record can hold four key value/pointer pairs. -There are two index records at the lowest level of the tree index.

(Essay)

4.9/5

(40)

Question 131

During an insertion operation into a hashed file, if the record's key value "hashes" to a location already occupied by another record, the record will not be inserted into the file.

(True/False)

4.8/5

(40)

Question 132

In the division remainder hashing algorithm, the divisor (the number divided into the key value) is the total number of record storage locations in the main storage area plus the overflow area.

(True/False)

4.8/5

(38)

Question 133

A logical view is an important device in ____.

(Multiple Choice)

4.9/5

(42)

Question 134

A fixed disk consists of five platters. Both surfaces of each of the five platters is used to record data. There are 75 tracks on each recording surface. How many of each of the following are there in the disk: a. Recording surfaces? b. Cylinders? c. Tracks per cylinder?

One of the main advantages of a hashed file is that it never has to be reorganized.

In a magnetic disk device, a single circle of stored data is called a _____.

Retrieval performance of a B+-tree indexed file can be improved by keeping the upper part of the index tree resident in main memory.

The delay from the time that the Enter Key is pressed to execute a query until the result appears on the screen is called ____.

The number of levels in a B+-tree index is permanently fixed at the time the file is created.

An access method is _____.

During an insertion operation into a hashed file, if the record's key value "hashes" to a location already occupied by another record, the record will not be inserted into the file.

In the division remainder hashing algorithm, the divisor (the number divided into the key value) is the total number of record storage locations in the main storage area plus the overflow area.

A logical view is an important device in ____.

Data: the New Corporate Resource

Data Modeling

The Database Management System Concept

Relational Data Retrieval: SQL

The Relational Database Model: Introduction

The Relational Database Model: Additional Concepts

Logical Database Design

Object-Oriented Database Management

Data Administration, Database Administration, and Data Dictionaries

Database Control Issues: Security, Backup and Recovery, Concurrency

Clientserver Database and Distributed Database

The Data Warehouse

Database and the Internet

Filters