Lesson 5 Flashcards

1
Q

atomic attribute

A

An attribute that cannot be further subdivided to produce meaningful components. For example, a person’s last name attribute cannot be meaningfully subdivided.

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

atomicity

A

The transaction property that requires all parts of a transaction to be treated as a single, indivisible, logical unit of work. All parts of a transaction must be completed or the entire transaction is aborted.

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

Boyce-Codd normal form (BCNF)

A

A special type of third normal form (3NF) in which every determinant is a candidate key. A table in BCNF must be in 3NF.

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

determinant

A

Any attribute in a specific row whose value directly determines other values in that row.

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

denormalization

A

A process by which a table is changed from a higher-level normal form to a lower-level normal form, usually to increase processing speed. Denormalization potentially yields data anomalies.

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

dependency diagram

A

A representation of all data dependencies (primary key, partial, or transitive) within a table.

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

first normal form (1NF)

A

The first stage in the normalization process. It describes a relation depicted in tabular format, with no repeating groups and a primary key identified. All nonkey attributes in the relation are dependent on the primary key.

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

fourth normal form (4NF)

A

A table is in 4NF if it is in 3NF and contains no multiple independent sets of multivalued dependencies.

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

granularity

A

The level of detail represented by the values stored in a table’s row. Data stored at its lowest level of granularity is said to be atomic data.

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

nonprime attribute

A

An attribute that is not part of a key.

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

normalization

A

A process that assigns attributes to entities so that data redundancies are reduced or eliminated.

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

partial dependency

A

A condition in which an attribute is dependent on only a portion (subset) of the primary key.

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

repeating group

A

In a relation, a characteristic describing a group of multiple entries of the same type for a single key attribute occurrence. For example, a car can have multiple colors for its top, interior, bottom, trim, and so on

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

second normal form (2NF)

A

The second stage in the normalization process, in which a relation is in 1NF and there are no partial dependencies (dependencies in only part of the primary key).

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

third normal form (3NF)

A

A table is in 3NF when it is in 2NF and no nonkey attribute is functionally dependent on another nonkey attribute; that is, it cannot include transitive dependencies.

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

transitive dependency

A

A condition in which an attribute is dependent on another attribute that is not part of the primary key.

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

Some very specialized applications may require normalization beyond the _____.

A

4NF

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

Repeating groups must be eliminated by ensuring that each row defines a single entity. (T/F)

A

True

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

Normalization is a process that is used for changing attributes to entities. (T/F)

A

True

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

A table that has all key attributes defined, has no repeating groups, and all its attributes are dependent on the primary key is said to be in _____.

A

1NF

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

Since a partial dependency can exist only if a table’s primary key is composed of several attributes, if a table in 1NF has a single-attribute primary key, then the table is automatically in 2NF. (T/F)

A

True

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

A relational table must not contain a(n) _____.

A

repeating group

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

When designing a database, you should _____.

A

make sure that the table entities are normalized before table structures are created

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

A dependency based on only a part of a composite primary key is called a _______

A

partial dependency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
A table is in BCNF if every determinant in the table is a candidate key. (T/F)
True
26
Reporting anomalies in a table can cause a multitude of problems for managers and can be fixed through application programming. (T/F)
False
27
It is possible for a table in 2NF to exhibit transitive dependency, where the primary key may rely on one or more nonprime attributes to functionally determine other nonprime attributes. (T/F)
True
28
An atomic attribute _____ .
cannot be further subdivided
29
Granularity refers to _____.
the level of detail represented by the values in a table's row
30
Attribute A _____ attribute B if all of the rows in the table that agree in value for attribute A also agree in value for attribute B.
determines
31
All relational tables satisfy the ______ requirements.
1NF
32
From a system functionality point of view, _____ attribute values can be calculated when they are needed to write reports or invoices.
derived
33
The objective of normalization is to ensure that each table conforms to the concept of well-formed relations. (T/F)
True
34
1NF, 2NF, and 3NF are _____.
normalization stages
35
A table that is in 1NF and includes no partial dependencies is said to be in _____.
2NF
36
In the ______, no row may contain two or more multivalued facts about an entity.
4NF
37
Normalization is a very important database design ingredient, and the highest level is always the most desirable. (T/F)
False
38
________ is a process that is used for changing attributes to entities.
Normalization
39
A dependency of one nonprime attribute on another nonprime attribute is a partial dependency. (T/F)
False
40
Dependencies that are based on only a part of a composite primary key are called transitive dependencies. (T/F)
False
41
Data redundancy produces _____ .
data anomalies
42
Dependencies can be identified with the help of a dependency ______.
diagram
43
Before converting a table into 3NF, it is imperative that the table already be in _____.
2NF
44
From a structural point of view, 2NF is better than _____.
1NF
45
_______ is a process of organizing the data in the database to avoid insertion anomaly, data redundancy, update and deletion anomaly.
Normalization
46
If a table has multiple candidate keys and one of those candidate keys is a composite key, the table can have _____ based on this composite candidate key even when the primary key chosen is a single attribute.
partial dependencies
47
Of the following normal forms, _____ is mostly of theoretical interest.
DKNF
48
For most business transactional databases, we should normalize relations into _____.
3NF
49
All relational tables satisfy the 1NF requirements. (T/F)
True
50
Normalization works through a series of stages called normal forms. For most purposes in business database design, _____ stages are as high as you need to go in the normalization process.
Three
51
In a(n) _____ diagram, the arrows above the attributes indicate all desirable dependencies.
dependency
52
A(n) _____ exists when there are functional dependencies such that Y is functionally dependent on X, Z is functionally dependent on Y, and X is the primary key.
transitive dependency
53
Because a partial dependency can exist only when a table's primary key is composed of several attributes, a table whose ______ key consists of only a single attribute is automatically in 2NF once it is in 1NF.
primary
54
The problem with transitive dependencies is that they still yield data _______, inconsistencies, and irregularities.
anomalies
55
A table that displays data redundancies yields _____.
anomalies
56
In the context of partial dependencies, data redundancies occur because every row entry requires duplication of data. (T/F)
True
57
Normalization works through a series of stages called normal forms. (T/F)
True
58
When a table contains only one candidate key, _____ are considered to be equivalent.
the 3NF and the BCNF
59
Dependency diagrams are very helpful in getting a bird's eye view of all the relationships among a table's attributes. (T/F)
True
60
Most designers consider the BCNF as a special case of the _____.
3NF
61
A dependency based on only a part of a composite primary key is known as a partial dependency. (T/F)
True
62
A determinant is any attribute whose value determines other values within a column. (T/F)
False
63
A _____ derives its name from the fact that a collection of multiple entries of the same type can exist for any single key attribute occurrence.
repeating group
64
An attribute that cannot be further subdivided is said to be ______.
atomic
65
BCNF can be violated only if the table contains more than one _____ key.
candidate
66
Data redundancy produces data anomalies. (T/F)
True
67
__________ specifies that a non-prime attribute is functionally dependent on part of a candidate key.
partial dependency
68
When designing a new database structure based on the business requirements of the end users, the database designer will construct a data model using a technique such as _____ ______ _______ ______.
Crow's Foot notation ERDs
69
________ refers to the level of detail represented by the values stored in a table's row.
Granularity
70
Improving _____ leads to more flexible queries.
atomicity
71
A table that is in 2NF and contains no transitive dependencies is said to be in _____.
3NF
72
An attribute that is part of a key is known as a(n) _____ attribute.
prime
73
Any attribute whose value determines other values within a row is known as a _______
determinant
74
Relational models view data as part of a table or collection of tables in which all key values must be identified. (T/F)
True
75
Any attribute that is at least part of a key is known as a
key attribute
76
________ is a process to help reduce the likelihood of data anomalies.
normalization
77
A transitive dependency is one in which an attribute is functionally dependent on another non-key attribute. (T/F)
True
78
Dependencies based on only a part of a composite primary key are known as _____ dependencies.
partial
79
Normalization produces a lower normal form. (T/F)
False
80
From a structural point of view, 3NF is better than _____.
2NF