Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

DBMS > The Relational Data Model > Flashcards

The Relational Data Model Flashcards

1
Q

Relational Data Model

A

A data model representing data in the form of tables.

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

Relation

A

A two dimensional table containing rows and columns of data.

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

Recursive Relationship

A

A relationship that relates an object set to it self.

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

Relation Attribute

A

A column in a relation

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

Degree of a relation

A

The number of attributes in a relation

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

Tuple

A

A row in a relation

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

Attribute Domain

A

The set from which an attribute takes its values.

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

Null Value

A

The value given an attribute in a tuple if the attribute is applicable or its value is unknown.

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

Super Key

A

A set of attributes that uniquely identifies each row in a relation.

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

Key

A

A minimal set of attributes that uniquely identifies each row in a relation.

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

Functionally Determine

A

To uniquely determine a value.

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

Composite Key

A

A key consisting of more than one attribute.

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

Candidate Key

A

Any set of attributes that could be chosen as a key of a relation.

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

Primary Key

A

The candidate key designated for principal use in uniquely identifying rows in a relation.

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

Foreign Key

A

A set of attributes in one relation that constitutes a key in some other or possibly the same relation used to indicate logical links between relations.

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

Recursive Foreign Key

A

A foreign key that references its own relation.

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

Relational Database Schema

A

A listing showing relation names attributes and foreign keys

18
Q

Constraint

A

A rule that restricts the values in a database.

19
Q

Entity Integrity Rule

A

The value of a non-null foreign key must be an actual key value in some relation.

20
Q

Normalization

A

The process of converting a relation to a standard form.

21
Q

Data Redundancy

A

Repetition of data in database.

22
Q

Data Integrity

A

Consistency of data in a database.

23
Q

Update Anomaly

A

Data inconsistency resulting from data redundancy and partial update,

24
Q

Deletion Anomaly

A

Unintended loss of data due to deletion of other data.

25
Q

Insertion Anomaly

A

In ability to add data to the database due to the absence of other data.

26
Q

Decomposition of Relations

A

Splitting a relation into multiple relations.

27
Q

Normal Forms

A

Rules for structuring relations that eliminate anomalies.

28
Q

First Normal Form(1NF)

A

All attribute values use must be atomic.

29
Q

Atomic Values

A

Value that is not a set of values or a repeating group.

30
Q

Functional Dependent

A

The value of an attribute in a tuple determines the value of another attribute in the tuple.

31
Q

Determinant

A

The attributes on the left side of a functional dependency determine the value of other attributes in the tuple.

32
Q

Second Normal Form(2NF)

A

No non-key attribute may be function ally dependent on just a part of the key.

33
Q

Projection of A Relation

A

A relation consisting of selected attributes from another relation.

34
Q

Third Normal Form(3NF)

A

Every determinant is a key.

35
Q

Boyce-Codd normal form(BCNF)

A

Every determinant is a key.

36
Q

Transitive Dependency

A

Occurs when a non-key attribute is functionally dependent on one or more other non-key attributes.

37
Q

Multivalued Dependency (MVD)

A

A constraint that guarantees the mutual independence of multivalued attributes.

38
Q

Fourth Normal Form(4NF)

A

A relation that is in third normal form and has no multivalued dependencies.

39
Q

Fifth Normal Form(5NF)

A

A normal form that eliminates join dependencies.

40
Q

Domain/Key normal form (DKNF)

A

Requires every constraints to result from definitions of domains and keys.

DBMS (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions