1.3 Flashcards

(12 cards)

1
Q

Define first normal form

A

No attribute contains more than a single value
Primary key for each record

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

Define second normal form

A

First normal form AND
No partial dependencies ( so no attributes depend on a composite key)

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

Define third normal form

A

Second normal form AND
No non key dependencies

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

Define indexing

A

Method to store the position of each record ordered by a certain attribute
(Normal done to secondary keys to make searching faster)

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

Define SQL

A

Declarative language
Used to manipulate databases

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

How to order an attribute in descending order

A

ORDER BY attribute Desc

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

Define referential integrity

A

Process of ensuring consistency
Ensures information is not removed if it is required elsewhere in a linked database

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

Define a transaction

A

Single operation executed on data

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

Define atomicity

A

Transaction must be processed in its entirety or not at all

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

Define consistency

A

Transaction must retain referential integrity rules between linked tables

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

Define isolation

A

Simultaneous executions of transactions must produce the same result as as if they were executed one after each other

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

Define durability

A

Once a transaction has been executed it will remain so

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