Consider two relations with three attributes each as R1(A1,A2,A3) and R2(B1, B2,B3)
R1(A3) references R2(B1). R2 is self referential R2(B1) references R2(B3). (On deletion cascade deletion is applied)
|
A1 |
A2 |
A3 |
|
k |
U |
3 |
|
L |
J |
3 |
|
L |
U |
5 |
|
K |
j |
6 |
|
B1 |
B2 |
B3 |
|
3 |
H |
5 |
|
5 |
J |
3 |
|
6 |
H |
1 |
|
7 |
j |
6 |
If delete operation is performed and all tuples in R1 are deleted that have R2(B1)=3.
This operation performs how many delete operations?
1
3
2
5
3
4
4
1