ch4 Flashcards

logical database design and the relational model

1
Q

relation

A

named 2D table of data. consists of the named columns(attributes)

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

primary key

A

unique ID for a row. underline it. AKA identifier

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

composite key

A

primary key that is composite

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

foreign key

A

primary key of one table stored in another table to establish relationship. dashed underline.

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

schema

A

overall logical structure of the database

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

difference between table and relation

A

relations pretty much cannot have repeats

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

integrity constraints

A

rules to make sure data is accurate and good

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

domain

A

set of values that may be assigned to attribute

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

entity integrity rule

A

make sure primary key is valid and unique, not null

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

null

A

absence of a value

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

referential integrity constraint

A

check if foreign keys are good

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

well-structured relation

A

minimal redundancy, allows modification and deletion with minimal headaches

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

anomaly

A

inconstancy that happens when you try to update a table with redundant data. three types: insertion, deletion, and modification anomalies

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

transforming EER into relations steps

A
1-map regular entities
2-map weak entities
3-map binary relationships
4-map associative entities
5-map unary relationships
6-map ternary (and n-ary) relationships
7-map supetype/subtype relationships
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

descriptors

A

non key attributes

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

surrogate primary key

A

different way of identifying weak entity, just generate a unique serial number. good way to simplify key structure.

17
Q

identifying relationship

A

in weak entities, owner relation

18
Q

partial identifier

A

unique part of weak entity. NOT primary key, primary key will be composite of owner and the partial id

19
Q

natural key

A

as oppossed to surrogate key, has meaning to organization P170

20
Q

recursive foreign key

A

foreign key in a relation references primary key of same relations. unary primary/foreign

21
Q

normalization

A

decompose relations with anomalies to produce smaller more well structured ones

22
Q

normalization main goal

A

decide which attributes should be grouped together to AVOID ANOMALIES

23
Q

normal form

A

attributes have to follow rules between them to be valid

24
Q

functional dependency

A

constraint between two attributes in which one attribute is determined by another. like a function, follows a one to one mapping.

25
Q

determinant

A

attribute on the left side of arrow in a functional dependency

26
Q

candidate key

A

attribute or group of attributes that can uniquely identify row