Apply the basic timestamp ordering bto algorithm schedules and
Assignment
3. Transaction Processing
For example, timestamps of transactions T1, T2, and T3 in schedule S1 are 3, 7, and 1 (respectively). [20 marks]
(b) Testing the serializability of S1 and S2 by serialization graph technique to prove that the successful execution of a schedule under BTO will ensure the serializability of the schedule. [15 marks]
Notice that PARENT(X, Y) means that X, Y are human-beings and X is the (biological) parent of Y; ANCESTOR(X, Y) means that X is the ancestor of Y.
Consider the following fact base:
PARENT(william, martin), PARENT(martin, tony), PARENT(tony, david),
PARENT(tony, jenny).
|
|||||
|---|---|---|---|---|---|
| olivia | |||||
|
|||||
sophia christopher
Consider that a database contains the following relations PARENT(X, Y)
PARENT (jenny, sophia).
PARENT (emma, olivia).
PARENT (michael, christopher).
(b) State a new rule named as SIBLING(X, Y) and construct a proof theoretic interpretation of this rule to find all siblings [10 marks].
1.Prove that FIRST_COUSIN(david, dorothy) is true. [10 marks]
2.Prove that COUSIN(sophia, christopher) is true. [10 marks]
