On 2014-04-02, 12:07 AM, Kenneth Chi Wai Ng wrote:
> I want to make sure I understand the content in slide 6-59.
>
> 1)
> Serializability is defined as "If several transactions are executed concurrently, the results must be the
> same as if they were executed serially in some order." Does "some order" mean as long as any serial execution of a permutation of T1, T2, ..., Tn matches a concurrent execution, that that the concurrency execution is serializable?
Some order means a conflict equivalent order.
> For example, I am assuming that H1 is considered serializable because it matches the outcome if the transactions were executed in serial fashion as T2, T1, T3 (or T2, T3, T1), but not in any other permutation?
See above.
>
> 2)
> Could it be explained as why H1 is not conflict equivalent to Hs but H3 is? I can tell the difference is that R3(x) is performed before/after C1 but I don't understand why.
See my in-class notes for the lectures that covered this material.
> 3)
> What is the difference between local history and global history. Could an example be given? In 6-63, I understand why the two local histories are no serializable (because there is a conflicting operation on T1 then T2 in one, and T2 then T1 in the other), but I don't fully grasp the concept of local history vs global history.
Local history (at some site) is history at that site.
Global history is history over all involved sites.
-K