Test Two Material Flashcards

1
Q

Normalization

A

a process for evaluating and correcting table structures to minimize data redundancies, thereby reducing the likelihood
of data anomalies.

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

a process for evaluating and correcting table structures to minimize data redundancies, thereby reducing the likelihood
of data anomalies.

A

Normalization

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

Denormalization

A

the process of attempting to optimize the read performance of a database by adding redundant data or by grouping data

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

the process of attempting to optimize the read performance of a database by adding redundant data or by grouping data

A

Denormalization

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

atomic attribute

A

if a value has component parts, the dbms either ignores the existence of those parts, or it provides functions to manipulate them

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

if a value has component parts, the dbms either ignores the existence of those parts, or it provides functions to manipulate them

A

atomic attribute

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

a property of database transactions which are guaranteed to either completely occur, or have no effects

A

atomicity

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

atomicity

A

a property of database transactions which are guaranteed to either completely occur, or have no effects

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

Boyce Codd Normal Form

A

is a normal form used in database normalization. It is a slightly stronger version of the third normal form (3NF).

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

is a normal form used in database normalization. It is a slightly stronger version of the third normal form (3NF).

A

Boyce Codd Normal Form

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

dependency diagram

A

bird’s-eye
view of all the relationships among a table’s attributes, and their use makes it less likely that you will overlook an important dependency.

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

bird’s-eye
view of all the relationships among a table’s attributes, and their use makes it less likely that you will overlook an important dependency.

A

dependency diagram

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

determinate

A

any attribute that you can use to determine the values assigned to other attribute(s) in the same row.

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

any attribute that you can use to determine the values assigned to other attribute(s) in the same row.

A

determinate

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

first normal form (1NF)

A

if the domain of each attribute contains only atomic values, and the value of each attribute contains only a single value from that domain.

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

if the domain of each attribute contains only atomic values, and the value of each attribute contains only a single value from that domain.

A

first normal form (1NF)

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

fourth normal form (4NF)

A

a level of database normalization where there are no non-trivial multivalued dependencies other than a candidate key. It builds on the first three normal forms (1NF, 2NF and 3NF) and the Boyce-Codd Normal Form (BCNF).

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

a level of database normalization where there are no non-trivial multivalued dependencies other than a candidate key. It builds on the first three normal forms (1NF, 2NF and 3NF) and the Boyce-Codd Normal Form (BCNF).

A

fourth normal form (4NF)

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

granularity

A

refers to the fineness with which data fields are sub-divided.

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

refers to the fineness with which data fields are sub-divided.

A

granularity

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

does not uniquely identify an instance of an entity

A

non key attribute

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

Non key attribute

A

does not uniquely identify an instance of an entity

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

a nonprime attribute is functionally dependent on part of a candidate key

A

partial dependency

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

an attribute that’s not part of any candidate key.

A

non prime attribute

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
non prime attribute
not part of any candidate key.
26
attributes of the candidate key which defines the uniqueness (Eg: SSN number in a employee database)
prime attribute
27
prime attribute
attributes of the candidate key which defines the uniqueness (Eg: SSN number in a employee database)
28
Any attribute that can have multiple values associated with a single instance of some entity.
repeating group
29
repeating group
Any attribute that can have multiple values associated with a single instance of some entity.
30
a book might have multiple authors is an example of
repeating group
31
second normal form (2NF)
It is in first normal form | All non-key attributes are fully functional dependent on the primary key
32
It is in first normal form | All non-key attributes are fully functional dependent on the primary key
second normal form (2NF)
33
third normal form (3NF)
the entity is in second normal form and all the attributes in a table are determined only by the candidate keys of that table and not by any non-prime attributes.[1]
34
the entity is in second normal form and all the attributes in a table are determined only by the candidate keys of that table and not by any non-prime attributes.[1]
third normal form (3NF)
35
transitive dependency
An indirect relationship between data elements in a database.
36
An indirect relationship between data elements in a database.
transitive dependency
37
Social security number is a ------------- of date-of-birth (SSN->DOB), because social security number is dependent on employee name (SSN->EMP), and employee name is dependent on date-of-birth (EMP->DOB) but not on social security number (there may be more than one John Smith or Maria Gomez).
transitive dependency
38
non key attribute examples
first name, last name, birth date
39
Consider a table with the attributes employee_id, first_name, last_name and date_of_birth. In this case, the field employee_id determines the remaining three fields. The name fields do not determine the employee_id because the firm may have more than one employee with the same first and/or last name. this is an example of what?
determinants
40
rules for 1FN
Eliminate repeating groups in individual tables. Create a separate table for each set of related data. Identify each set of related data with a primary key
41
rules for 2NF
if it is in 1NF and no non-prime attribute is dependent on any proper subset of any candidate key of the table.
42
update anomoly
exists when one or more instances of duplicated data is updated, but not all
43
exists when one or more instances of duplicated data is updated, but not all
update anomoly
44
Insertion Anamoly
occurs when certain attributes cannot be inserted into the database without the presence of other attributes.
45
occurs when certain attributes cannot be inserted into the database without the presence of other attributes.
Insertion Anamoly
46
exists when certain attributes are lost because of the deletion of other attributes.
deletion anamoly
47
deletion anamoly
exists when certain attributes are lost because of the deletion of other attributes.
48
Contains only atomic values | There are no repeating groups
1NF
49
cannot be divided
atomic value
50
you remove subsets of data that apply to multiple rows of a table, place them in separate tables, and create relationships between these new tables and the original tables through the use of foreign keys.
2NF
51
you remove columns that are not dependent upon the primary key.
3NF
52
you eliminate duplicate columns from the same table,create separate tables for each group of related data, and identify each row with a unique column or set of columns (the primary keys).
1NF
53
There are no repeating or duplicate fields Each cell contains only a single value Each record is unique (identified by primary key)
1NF
54
All non-key fields depend on components of the primary key
2NF
55
all non-key fields depend on the primary key
3NF
56
”A -> C” is a ----- dependency when it is true only because both “A -> B” and “B -> C” are true
transitive
57
A-------dependency is an indirect functional dependency, one in which X→Z only by virtue of X→Y and Y→Z.
transitive
58
when a record is deleted, other information that is tied to it is also deleted
deletion anamoly
59
user is unable to insert a new record of data when it should be possible to do so because not all other information is available.
insertion anamoly
60
a record is updated, but other appearances of the same items are not updated
update anamoly
61
A change in Address must be made in several places. Updating one fact may require updating multiple tuples.
update anamoly
62
Possible primary key that was not chosen as the primary key
Candidate key