Mod4-Relational Database Flashcards

1
Q

Tables (relations), rows, columns

A

data structure

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

◦ Mechanisms for implementing business rules that
maintain integrity of manipulated data

A

data integrity

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

Powerful SQL operations for retrieving and modifying data

A

data manipulation

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

is a named, two-dimensional table of data.

A

relation

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

consists of rows (records) and columns (attribute or field).

A

table/relation

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

➢ Every attribute value must be atomic (not multivalued, not composite).

A

true

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

➢ Every row must be unique (can’t have two rows with exactly the same values
for all their fields).

A

true

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

➢ Attributes (columns) in tables must have unique names.
➢ The order of the columns must be irrelevant.
➢ The order of the rows must be irrelevant.

A

true

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

correspond with entity types and with many-to-many
relationship types.

A

relation(tables)

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

correspond with entity instances and with many-to-many relationship
instances.

A

rows

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

correspond with attributes.

A

columns

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

The word relation (in relational database) is NOT the same as the
word relationship(in E-R model).

A

true

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

are unique identifiers of the relation. Examples include employee
numbers, social security numbers, etc. This guarantees that all rows are unique.

A

primary keys

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

are identifiers that enable a dependent relation (on the many side of a
relationship) to refer to its parent relation (on the one side of the relationship).

A

foreign keys

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

can be simple (a single field) or composite
(more than one field).

A

keys

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

usually are used as indexes to speed up the
response to user queries.

A

keys

17
Q

domain constraints
entity integrity

A

integrity constraints

18
Q

▪ Allowable values for an attribute

A

domain contraints

19
Q

No primary key attribute may be null. All primary key fields MUST have data.

A

entity integrity

20
Q

rule states that any foreign key value (on the relation of the many
side) MUST match a primary key value in the relation of the one side. (Or the foreign
key can be null)
are drawn via arrow from dependent to parent table
are implemented with foreign key to primary key references

A

referential integrity

21
Q

: E-R attributes map
directly onto the relation
Mapping Regular Entities to Relations

A

simple attributes

22
Q

Use only their
simple, component attributes
Mapping Regular Entities to Relations

A

composite attributes

23
Q

Becomes a separate
relation with a foreign key taken from the
superior entity
Mapping Regular Entities to Relations

A

multivalued attributes

24
Q

▪Becomes a separate relation with a foreign
key taken from the superior entity
▪Primary key composed of:
✓Partial identifier of weak entity
✓Primary key of identifying relation (strong
entity)

A

mapping weak entities

25
Q

➢ One-to-Many–Primary key on the one side
becomes a foreign key on the many side
➢ Many-to-Many–Create a new relation with the
primary keys of the two entities as its primary key
➢ One-to-One–Primary key on mandatory side
becomes a foreign key on optional side

A

mapping binary relationships

26
Q

▪ Identifier Not Assigned
▪ Default primary key for the association relation is
composed of the primary keys of the two entities
(as in M:N relationship)
▪ Identifier Assigned
▪ It is natural and familiar to end-users
▪Default identifier may not be unique

A

mapping associative entities

27
Q

▪One-to-Many–Recursive foreign key in the same
relation
▪Many-to-Many–Two relations:
▪ One for the entity type
▪ One for an associative relation in which the primary
key has two attributes, both taken from the primary
key of the entity

A

mapping unary relationships

28
Q

➢ One relation for each entity and one for the
associative entity
➢ Associative entity has foreign keys to each
entity in the relationship

A

mapping ternary(and n-ary) relationships

29
Q

➢ One relation for supertype and for each subtype
➢ Supertype attributes (including identifier and subtype
discriminator) go into supertype relation
➢ Subtype attributes go into each subtype; primary key of
supertype relation also becomes primary key of subtype
relation
➢ 1:1 relationship established between supertype and each
subtype, with supertype as primary table

A

mapping supertype/subtype relationships