Ch9 Test

A ________ is an attribute that appears as a non-primary key attribute in one relation and as a primary key attribute (or part of a primary key) in another relation. Foreign key Unique key Primary key Referential integrity

a

A unary relationship is a relationship between the instances of a ________ entity type, which are also called recursive relationships. Single Many Triple Double

a

Each ________ in a relation corresponds to an attribute of that relation. Column Entity Data Row

a

Each ________ of a relation corresponds to a record that contains data values for an entity. Row Entity Attribute Column

a

Each entity type in the E-R diagram becomes a relation. The identifier of the entity type becomes the ________ of the relation, and other attributes of the entity type become non-primary key attributes of the relation. Primary key Foreign key Unique key Index

a

In ________ normal form, non-primary key attributes do not depend on each other (what we call no transitive dependencies). Third Second Fourth First

a

The key should be ________; that is, no attribute in the key can be deleted without destroying its unique identification. Non-redundant De-normalized Redundant Normalized

a

A binary one-to-many (1:N) relationship in an E-R diagram is represented by adding the primary key attribute (or attributes) of the entity on the one side of the relationship as a(n) ________ in the relation that is on the many side of the relationship. Unique key Foreign key Primary key Index

b

A recursive foreign key is a foreign key in a relation that references the ________ values of that same relation. Foreign key Primary key Non-primary key Unique key

b

A relation is a named, ________-dimensional table of data. Each relation (or table) consists of a set of named columns and an arbitrary number of unnamed rows. Four Two One Three

b

A relation is in ________ if every non-primary key attribute is functionally dependent on the whole primary key. 1NF 2NF 4NF 3NF

b

Each partition is stored in a separate contiguous section of disk space, which Oracle calls a(n) ________. Database Tablespace Table Index

b

Entries in cells are simple and an entry at the intersection of each row and column has a ________ value. Repeating Single Multi Duplicate

b

In a relation, the sequence of columns can be interchanged without changing the meaning or use of the ________. Attribute Relation Row Primary key

b

In logical database modeling and design, we translate the ________ E-R data model for the application or enterprise, developed without explicit consideration of specific user interfaces, into normalized data requirements. Physical Conceptual Logical Normal

b

The result of normalization is that every ________ key attribute depends upon the whole primary key. Primary Non-primary Unique Candidate

b

________ is a process for converting complex data structures into simple, stable data structures. De-normalization Normalization Database modeling Relation

b

in most situations, many physical database design decisions are implicit or eliminated when we choose the ________ technologies to use with the application. System management Data management SDLC Software management

b

A computer operating system stores data in a ________, which is a named set of table rows stored in a contiguous section of secondary memory. Table Tablespace Physical file Disk

c

A functional dependency between ________ key attributes is also called a transitive dependency. Composite Unique Non-primary Primary

c

A functional dependency is a particular relationship between two ________. Tables Databases Attributes Rows

c

A well-structured relation is a relation that contains a minimum amount of redundancy and that allows users to insert, modify, and delete the rows without error or inconsistencies and is also known as a ________. Column Row Table Key

c

A(n) ________ is a file organization in which rows are stored either sequentially or non-sequentially, and an index is created that allows software to locate individual rows. Physical file Hashed file organization Indexed file organization Sequential file organization

c

A(n) ________ is an attribute (or combination of attributes) whose value is unique across all occurrences of a relation. Identifier Index Primary key Composite key

c

A(n) ________ is one field or a combination of fields for which more than one row may have the same combination of values. Primary key Index Secondary key Pointer

c

Logical and ________ database design is typically performed in parallel with other systems design steps. Normalized Normal Physical Conceptual

c

The ________ families of file organizations cover most of the file organizations we will have at our disposal as we design physical files and databases. Five Four Three Two

c

The capability to split a table into separate sections, often called ________, is possible with most relational database products. Normalizing Splitting Partitioning Combining

c

________ is NOT a valid degree of the relationship. Binary Ternary N-ary Unary

c

In ________ normal form, each non-primary key attribute is identified by the whole key (what we call full functional dependency). First Third Fourth Second

d

In logical database modeling and design, we combine normalized data requirements from all user interfaces into one consolidated logical database model; this step is called view ________. Summation Addition Combination Integration

d

In some situations, a single attribute name, called a(n) ________, may have more than one meaning or describe more than one characteristic. Duplicate Synonym Antonym Homonym

d

We begin the physical design phase by addressing the design of physical fields for each attribute in a ________ data model. Conceptual Conventional Physical Logical

d

Which relation is created by placing the primary key of either entity in the relation for the other entity or by doing this for both entities? Binary 1:N relationship Associative entity with additional key Weak entity Unary 1:1 relationship

d

Which relation is created by placing the primary key of the entity on the one side of the relationship as a foreign key in the relation for the entity on the many side? Associative entity Associative entity with additional key Weak entity Binary 1:N relationship

d

Which relation is created with primary key and non-key attributes only? Associative entity Weak entity Sub-type Regular entity

d