chapter 4 review Flashcards

(37 cards)

1
Q

t or f: the relational DB model offers a logical view of data?

A

true

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

view data logically rather than physically?

A

relational model

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

structural and data independence.
resembles a file conceptually?

A

table

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

t or f: relational DB model is harder to understand than the hierarchical and network model?

A

false

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

logical view of relational DB is based on….

A

relation

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

two-dimensional structure composed of rows and columns.

A

table

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

t or f: a table contains a group of related entities?

A

true

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

one or more attributes that determine other attributes

A

key

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

t or f: key roles means if you know the value of attribute A, you can determine the value of attribute B

A

t

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

attribute B is functionally dependent on A if all rows in the table that agree in value for A also agree in the value of B, this is def of?

A

functional dependence

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

composed of more than one attribute?

A

composite key

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

any attribute that is a part of a key

A

key attribute

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

any key that uniquely identifies each row

A

superkey

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

a superkey without unnecessary attributes

A

candidate key

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

each row in a table has its unique identity

A

entity integrity

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

no data entry is an example of?

17
Q

makes the relational DB work?

A

controlled redundency

18
Q

t or f: data within the same DB share the same attributes

19
Q

t or f: redundancy exists only when there is unnecessary duplication of attribute values?

20
Q

an attribute whose values match primary key values in a related table

21
Q

FK contains a value that refers to an existing valid tuple in another relation

A

referential integrity

22
Q

key used strictly for data retrieval purposes

A

secondary key

23
Q

t or f: many relational database managements enforce integrity rules automatically

24
Q

flags indicate the absence of some values

A

using flags to avoid nulls

25
provides a detailed accounting of all tables found within a user-created database
data dictionary
26
t or f: data dictionary contains all attribute names and characteristics for each table in the system and metadata
true
27
detailed system data dictionary that describes all objects within the database
system catalog
28
indicates the use of the same name to label different attributes
homonym
29
indicates the use of different names to label the same attribute
synonym
30
relational modeling ideal
1:m
31
should be rare in any relational DB design
1:1
32
cant be implemented can be changed into 1:m relationships
m:n
33
what relation is found in any DB environment?
1:m
34
sometimes means that entities were not defined properly
1:1
35
avoid problems inherent to m:n relationship by creating a composite key in which relation?
m:n
36
controls data redundancy by using common attributes shared by table in the?
FK
37
t or f: data redundancy is not necessary
false