boris/G4G0-1
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

vault backup: 2024-02-15 11:46:55

Browse Source
This commit is contained in:
George Wilkinson
2024-02-15 11:46:55 +00:00
parent 8db24321e6
commit 7f6d033cc4
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Semester 2/Database Systems/Week 5/Week 5 Database Systems.md
View File

@@ -53,8 +53,7 @@ Since the operation is functionally the same as a serial schedule, we can consid
5. The precedence graph is serialisable since it is acyclic. No directed cycles. 5. The precedence graph is serialisable since it is acyclic. No directed cycles.
6. T1.1 -> T2.2, T1.2 -> T2.1, T1.2 -> T2.2, T1.2 -> T3.1, T2.2 -> T3.1 6. T1.1 -> T2.2, T1.2 -> T2.1, T1.2 -> T2.2, T1.2 -> T3.1, T2.2 -> T3.1
- ![](Pasted%20image%2020240213172304.png) - ![](Pasted%20image%2020240213172304.png)
The graph is serialisable since there are no directed cycles. - The graph is serialisable since there are no directed cycles.
1. T2.1 -> T1.1, T1.1 -> T2.2, T2.2 -> T1.2 1. T2.1 -> T1.1, T1.1 -> T2.2, T2.2 -> T1.2
- ![](Pasted%20image%2020240213172509.png) - ![](Pasted%20image%2020240213172509.png)
The graph is not serialisable since there is a directed cycle The graph is not serialisable since there is a directed cycle