Chapter 3 - The Relational Database Model Flashcards

1
Q

Attribute domain

A

Specific range of values for an attribute.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Candidate Key

A

A minimal (irreducible) superkey; a superkey that does not contain a subset of attributes that is itself a superkey.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Closure

A

Use of relational algebra operators on existing relations produces new relations.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Composite Entity

A

AKA Bridge or Associative entity. Helps avoid problems inherent to M:N relationships, includes the primary keys of tables to be linked

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Composite key

A

Key that is composed of more than one attribute

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Data Dictionary

A

Description of all tables in the database created by the user and designer. Metadata, data about the data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Dependent

A

Attribute whose value is determined by the other attribute.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Determinant

A

Attribute whose value determines another.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Determination

A

State in which knowing the value of one attribute makes it possible to determine the value of another.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Domain

A

In data modeling, the construct used to organize and describe an attribute’s set of possible values.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Entity Integrity

A

Condition in which each row in the table has its own unique identity. All values in PK must be unique and no key attribute in the primary key can contain a null.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Equijoin

A

Links tables on the basis of an equality condition that compares specified columns of each table.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Flags

A

Special codes used to indicate the absence of some value.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Foreign Key (FK)

A

An attribute or combination of attributes in one table whose values must either match the primary key in another table or be null.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Full Functional Dependence

A

Entire collection of attributes in the determinant is necessary for the relationship.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Functional Dependence

A

Value of one or more attributes determines the value of one or more other attributes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Homonym

A

Same name is used to label different attributes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Index

A

Orderly arrangement to logically access rows in a table. Associated to only one table.

19
Q

Index Key

A

Index’s reference point that leads to data location identified by the key.

20
Q

Inner Join

A

Only returns matched records from the tables that are being joined.

21
Q

Join Column(s)

A

Common columns in a natural join.

22
Q

Key

A

An entity identifier based on the concept of functional dependence.

23
Q

Key Attribute

A

Attribute that is a part of a key

24
Q

Left Outer Join

A

Yields all of the rows in the first table, including those that do not have a matching value in the second table.

25
Q

Linking Table

A

In the relational model, a table that implements an M:M relationship.

26
Q

Natural Join

A

Links tables by selecting only the rows with common values in their common attributes.

27
Q

Null

A

Absence of any data value that could represent:

28
Q

Outer Join

A

Matched pairs are retained and unmatched values in the other table are left null.

29
Q

Predicate Logic

A

Used extensively in mathematics to provide a framework in which an assertion (statement of fact) can be verified as either true or false.

30
Q

Primary key (PK)

A

Attribute or combination of attributes that uniquely identifies any given row.

31
Q

Referential Integrity

A

Every reference to an entity instance by another entity instance is valid.

32
Q

Relational Algebra

A

Theoretical way of manipulating table contents using relational operators.

33
Q

Relvar

A

Variable that holds a relation

34
Q

Right Outer Join

A

Yields all of the rows in the second table, including those that do not have matching values in the first table.

35
Q

Secondary Key

A

An attribute or combination of attributes used strictly for data retrieval purposes.

36
Q

Set Theory

A

A part of mathematical science that deals with sets, or groups of things, and is used as the basis for data manipulation in the relational model.

37
Q

Superkey

A

An attribute or combination of attributes that uniquely identifies each row in a table.

38
Q

Synonym

A

Different names are used to describe the same attribute.

39
Q

System Catalog

A

System data dictionary that describes all objects within the database.

40
Q

Theta Join

A

Extension of natural join, denoted by adding a theta subscript after the JOIN symbol.

41
Q

Tuple

A

A table row that represents a single entity occurrence within the entity set.

42
Q

Union-Compatible

A

Tables share the same number of columns, and their corresponding columns share compatible domains.

43
Q

Unique Index

A

Index key can have only one pointer value associated with it.