Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Intro to Database Systems > Chapter 6 > Flashcards

Chapter 6 Flashcards

1
Q

Normalization works through a series of stages called normal forms.

A

True

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

Normalization produces a lower normal form.

A

False

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

In order to meet performance requirements, you may have to denormalize portions of the database design.

A

True

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

Denormalization produces a lower normal form.

A

True

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

Normalization is a very important database design ingredient and the highest level is always the most desirable.

A

False

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

A table is in BCNF if every determinant in the table is a foreign key.

A

False

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

A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.

A

True

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

Relational models view the data as part of a table or collection of tables in which all key values must be identified.

A

True

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

Dependency diagrams are very helpful in getting a bird’s-eye view of all the relationships among a table’s attributes.

A

True

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

Dependencies that are based on only a part of a composite primary key are called transitive dependencies.

A

False

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

All relational tables satisfy the 1NF requirements.

A

True

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

Converting a database format from 1NF to 2NF is a complex process.

A

False

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

Because 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.

A

True

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

A table is in 2NF if it is in 1NF and it includes no partial dependencies.

A

True

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

A determinant is any attribute whose value determines other values within a column.

A

False

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

A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.

A

False

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

Atomic attributes are attributes that can be further subdivided.

A

False

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

Normalization represents a micro view of the entities within the ERD.

A

True

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

The combination of normalization and ER modeling yields a useful ERD, whose entities may now be translated into appropriate relationship structures.

A

False

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

A good relational DBMS excels at managing denormalized relations.

A

False

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

Normalization purity is easy to sustain in the modern database environment.

A

False

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

Unnormalized database tables often lead to various data redundancy disasters in production databases.

A

True

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

Attributes should clearly define participation, connectivity, and document cardinality.

A

False

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

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.

A

three

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

1NF, 2NF, and 3NF are ____.

A

normalization stages

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

____ yields better performance.

A

denormalization

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

An attribute that is part of a key is known as a(n) ____ attribute.

A

prime

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

A table that displays data redundancies yields ____.

A

anomalies

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
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
30
Q

Of the following normal forms, ____ is mostly of theoretical interest.

A

DKNF

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

A(n) ____ exists when there are functional dependencies such that Y is functionally dependent on X and Z is functionally dependent on Y, and X is the primary key.

A

transitive dependency

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

A ____ derives its name from the fact that a group of multiple entries of the same type can exist for any single key attribute occurrence.

A

repeating group

33
Q

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

A

repeating group

34
Q

Dependencies based on only a part of a composite primary key are called ____ dependencies.

A

partial

35
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

36
Q

A table that is in 1NF and includes no partial dependencies is said to be in ____.

A

2NF

37
Q

If you have three different transitive dependencies, ____ different determinant(s) exist.

A

three

38
Q

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.

A

partial dependencies

39
Q

A table that is in 2NF and contains no transitive dependencies is said to be in ____.

A

3NF

40
Q

According to naming conventions described in Chapter 2, ____ would be the best name for a column representing the charges per hour in a table named JOB.

A

JOB_CHG_HOUR

41
Q

An atomic attribute ____.

A

cannot be further subdivided

42
Q

The most likely data type for a surrogate key is ____.

A

numeric

43
Q

Granularity refers to ____.

A

the level of detail represented by the values stored in a table’s row

44
Q

In a real-world environment, we must strike a balance between design integrity and ____.

A

flexibility

45
Q

For most business transactional databases, we should normalize relations into ____.

A

3NF

46
Q

To generate a surrogate key, Microsoft Access uses a(n) ____ data type.

A

AutoNumber

47
Q

BCNF can be violated only if the table contains more than one ____ key.

A

candidate

48
Q

Most designers consider the BCNF as a special case of the ____.

A

3NF

49
Q

A table where all attributes are dependent on the primary key and are independent of each other, and no row contains two or more multivalued facts about an entity, is said to be in ____.

A

4NF

50
Q

When designing a database, you should ____.

A

-make sure entities are in normal form before table structures are created

create table structures then normalize the database

only normalize the database when performance problems occur

consider more important issues such as performance before normalizing

51
Q

Normalization represents a micro view of the ____ within the ERD.

A

entities

52
Q

An example of denormalization is using a ____ denormalized table to hold report data. This is required when creating a tabular report in which the columns represent data that is stored in the table as rows.

A

temporary

53
Q

____ databases reflect the ever-growing demand for greater scope and depth in the data on which decision support systems increasingly rely.

A

data warehouse

54
Q

Normalization works through a series of stages called normal forms.

A

true

55
Q

Normalization is a process that is used for changing attributes to entities.

A

false

56
Q

Denormalization produces a lower normal form.

A

true

57
Q

A table is in BCNF if every determinant in the table is a candidate key.

A

true

58
Q

A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.

A

true

59
Q

Repeating groups must be eliminated by making sure that each row defines a single entity.

A

true

60
Q

Dependencies that are based on only a part of a composite primary key are called transitive dependencies.

A

false

61
Q

With partial dependencies, data redundancies occur because every row entry requires duplication of data.

A

true

62
Q

Because 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.

A

true

63
Q

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.

A

true

64
Q

A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.

A

false

65
Q

Normalization should be part of the design process.

A

true

66
Q

The combination of normalization and ER modeling yields a useful ERD, whose entities may now be translated into appropriate relationship structures.

A

false

67
Q

The advantage of higher processing speed must be carefully weighed against the disadvantage of data anomalies.

A

true

68
Q

Unnormalized database tables often lead to various data redundancy disasters in production databases.

A

true

69
Q

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.

A

three

70
Q

From a structural point of view, 2NF is better than ____.

A

1NF

71
Q

An attribute that is part of a key is known as a(n) ____ attribute.

A

prime

72
Q

Data redundancy produces ____.

A

data integrity problems

73
Q

Of the following normal forms, ____ is mostly of theoretical interest.

A

DKNF

74
Q

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.

A

determines

75
Q

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

A

repeating group

76
Q

In a(n) ____ diagram, the arrows above the attributes indicate all desirable dependencies.

A

dependency

77
Q

A table that is in 1NF and includes no partial dependencies is said to be in ____.

A

2NF

78
Q

Before converting a table into 3NF, it is imperative the table already be in ____.

A

2NF

79
Q

A table that is in 2NF and contains no transitive dependencies is said to be in ____.

A

3NF

Intro to Database Systems (11 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions