Chapter 3 (part 1)

The relationship should be rare in any relational database design. - 1:1 - 1:M - M:1 - M:N

1:1

The relationship is the "relational model ideal." - 1:1 - 1:M - M:1 - M:N

1:M

Another name for a composite entity is a ... entity. - bridge - linked - directive - associative

Bridge or Associative

A ... key can be described as a minimal superkey, a super key without any unnecessary attributes. - secondary - candidate - primary - foreign

Candidate

Each table ... represents an attribute. - column - row - dimension - value

Column

A contains at least all of the attribute names and characteristics for each table in the system. - data dictionary - relational schema - logical schema - database

Data dictionary

The CUSTOMER table's primary key is CUS_CODE. The CUSTOMER primary key column has no null entries, and all entries are unique. This is an example of ... integrity. - entity - referential - relational - null

Entity

A is the primary key of one table that has been placed into another table to create a common attribute. - superkey - composite primary key - candidate key - foreign key

Foreign key

In a database context, the word ... indicates the use of the same attribute name to label different attributes. - redundancy - homonym - duplicate - synonym

Homonym

A is an orderly arrangement used to logically access rows in a table. - primary rule - superkey - relationship - index

Index

A only returns matched records from the tables that are being joined. - outer join - inner join - equijoin - theta join

Inner join

Referential ... dictates that the foreign key must contain values that match the primary key in the related table, or must contain null. - integrity - uniqueness - model - attribute

Integrity

Date attributes contain calendar dates stored in a special format known as the ... date format. - Epoch - calendar - Julian - logical

Julian

In the relational model, ... are important because they are used to ensure that each row in a table is uniquely identifiable. - relations - keys - indexes - logical structures

Keys

According to Codd's ... rule of relational databases, application programs and ad hoc facilities are logically unaffected when changes are made to the table structures that preserve the original table values (changing order of columns or inserting columns). - distribution independence - logical data independence - comprehensive data sublanguage - integrity independence

Logical data independence

relationships can be implemented by creating a new entity in 1:M relationships with the original entities. - 1:N - M:1 - M:N - 1:1

M:N

A join links tables by selecting only the rows with common values in their common attribute(s). - attribute - unique - foreign - natural

Natural

According to Codd's ... rule of relational databases, if the system supports low-level access to the data, users must not be allowed to bypass the integrity rules of the database. - nonsubversion - information - guaranteed access - view updating

Nonsubversion

The constraint can be placed on a column to ensure that every row in the table has a value for that column. - unique - not null - value - empty

Not null

are especially useful when you are trying to determine what values in related tables cause referential integrity problems. - inner joins - outer joins - equijoins - theta joins

Outer joins

returns only the attributes requested, in the order in which they are requested. - PROJECT - SELECT - UNION - DIFFERENCE

PROJECT

logic, used extensively in mathematics, provides a framework in which an assertion (statement of fact) can be verified as either true or false. - predicate - database - relational - index

Predicate

To be considered minimally relational, the DBMS must support the key relational operators ..., PROJECT, and JOIN. - INTERSECT - UNION - DIFFERENCE - SELECT

SELECT

also known as RESTRICT, yields values for all rows found in a table that satisfy a given condition. - INTERSECT - UNION - DIFFERENCE - SELECT

SELECT

A key is defined as a key that is used strictly for data retrieval purposes. - lookup - foreign - candidate - secondary

Secondary

A is any key that uniquely identifies each row. - superkey - special key - foreign key - candidate key

Superkey

In a database context, a ... indicates the use of different names to describe the same attribute. - entity - duplicate - synonym - homonym

Synonym

The is actually a system-created database whose tables store the user/designer-created database characteristics and contents. - database tuple - systematic database - unique index - system catalog

System catalog

When two or more tables share the same number of columns, and when their corresponding columns share the same or compatible domains, they are said to be ... - intersect-compatible - union-compatible - difference-compatible - select-compatible

Union-compatible

When you define a table's primary key, the DBMS automatically creates a ... index on the primary key column(s) you declared. - key - composite - unique - primary

Unique