Tentamen Flashcards

1
Q

What does it mean for a natural join to not be lossless?

A

There may be tuples in the natural join of R1 and R2 that are not found in R.

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

What does it mean to be lossless?

A

All relations in the natural join of R1 and R2 are also in the original relation R.

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

What are the differences between relations and relationships?

A

Relations: bags of tuples
Relationships: Concept in ER, where it is about a connection between two concepts

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

What is a virtual view?

A

A view contains values from tables, a virtual view does not store these values, thus they change when the underlying data changes.

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

What is a materialized view?

A

A view contains values from tables, a material view stores the values of the view. This can be updated periodically or every time the underlying tables are updated.

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

What are indices?

A

An index is a tree-like sturcture, called a B-tree, in which you can easiliy find nodes that correspond to the tuples with a certaint value for the attributes. This makes it vary low cost to search in a B-tree.

However it is very “expensive” to create, and update. An index ofter is created for something for which we create a where statement.

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

How to find the BCNF violations?

A

Check all FD’s (also implied) to find all the FD’s that are not a super key for the entire relation.

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

How to find all FD’s that hold in decomposition?

A

Find all FD’s (also implied) that are in the relation

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

How to find the FD’s in a join?

A

Just all FD’s that you had before.

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

What is a weak entity set? How to find it?

A

A weak entity set is a set that hasn’t enought entities to identify itself. They have a double line.

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

What are referential-integrity constraints?

A

Any one that is a weak ES. (I believe just every many-one relationship).

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