Referential integrity Flashcards

(9 cards)

1
Q

What is referential integrity?(3 points)

A
  1. Ensuring that changes are consistent across a database
    2.if a record is removed all references to it are removed
    3.A foreign key value must have a corresponding Primary key value in another table.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Describe what is meant by the term ‘Durable’ in the context of ACID transactions.

A

data is not lost in case of power failure

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

What does ACID stand for?

A

Atomicity, Consistency, Isolation and Durability.

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

Give one disadvantage of using record locking.

A

Can cause deadlock

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

Describe what is meant by the term ‘Atomic’ in the context of ACID transactions.

A

A transaction can only fully complete or not complete cant be partially completed.

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

What is record locking and why is it used?

A

Record locking stops more than one user from changing the same data at the same time. It helps keep data safe and correct.

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

Describe what is meant by the term ‘Isolation’ in the context of ACID transactions.

A

A transaction must not be interrupted by another transaction. Transaction must occur in isolation. Simultaneous executions of transactions should lead to the same result as if they were executed one after the other,

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

Describe what is meant by the term ‘Consistency’ in the context of ACID transactions.

A

The database must move from one valid state to another after a transaction, must maintain referential inegrity after each transaction.

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

What is Transaction processing?

A

Transaction processing means doing a group of steps together as one task.
All steps must finish, or none happen at all.

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