The relational database model Flashcards

1
Q

predicate logic

A

used extensively in mathematics to provide a framework in which an assertion can be verified as either true or false

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

set theory

A

a part of mathematical science that deals with sets, or groups of things, and is used as the basis for data manipulation in the relational model

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

tuple

A

in the relational model, a table row

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

attribute domain

A

in data modelling, the construct used to organize and describe an attribute’s set of possible values

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

primary key

A

an attribute or combination or attributes that uniquely identifies any given row

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

a key

A

consists of one or more attributes that determine other attributes

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

determination

A

the state in which knowing the value of one attribute makes it possible to determine the value of another

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

functional dependence

A

the value of one or more attributes determines the value of one or more pother attributes

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

full functional dependence

A

used to refer to functional dependencies in which the entire collection of attributes in the determinant is necessary for the relationship

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

composite key

A

a key that is composed of more than one attribute

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

key attribute

A

an attribute that is part of a key

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

superkey

A

a key that can uniquely identify any row in the able

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

candidate key

A

a superkey without any unnecessary attributes. hence a minimalist key

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

entity ingrity

A

the condition in which each row in the table has its own unique identity

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

foreign key

A

an attribute or attributes in one table whose values must match the primary key in another table or whose values must be null

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

referential integrity

A

a condition by which a dependent table’s foreign key must have either a null entry or a matching entry in the related table

17
Q

secondary key

A

an additional key, or alternate key, which can be use in addition to the primary key to locate specific data

18
Q

existence dependence

A

the entity can exist in the database only when it is associated with another related entity occurence, hence it has a mandatory foreign key

19
Q

non identifying relationship

A

aka a weak relationship. exists if the primary key of the related entity foes not contain a primary key component of the parent entity

20
Q

identifying relationship

A

a strong relationship when the primary key of the related entity contains a primary key component of the parent entity

21
Q

characteristics of a weak entity

A
  • the entity is existence-dependent
  • the entity has a primary key that is partially or totally derived from the parent entity in the relationship
22
Q

optional participation

A

one entity occurrence does not require a corresponding entity occurrence in a particular relationship

23
Q

cardinality

A

the minimum and maximum number of entity instances in a relation

24
Q

mandatory participation

A

one entity occurrence requires a corresponding entity occurrence in a particular relationship

25
Q

relationship degree

A

indicates the number of entities or participants associated with a relationship

26
Q

unary relationship

A

exists when an association is maintained within a single entity

27
Q

binary relationship

A

exists when two entities are associated

28
Q

ternary relationship

A

exists when three entities are associated

29
Q

recursive relationship

A

a relationship within a single entity type

30
Q

associative (composite) entities

A
  • used to represent an M:N relationship
  • composed of the primary key attributes of each parent entity