A model of nested transactions in distributed database systems ispresented. The modeling approach is based on conflict serializabilityextended to accommodate multilevel transactions. Based on thesedefinitions, serialization graph testing for nested transactions isdiscussed. Three concurrency control algorithms and proofs of theircorrectness are presented. The algorithms are an adaptation ofserialization graph testing, an adaptation of the timestamp orderingprotocol, and a variation of an optimistic protocol presented by H.T.Kung and J.T. Robinson (1981)
展开▼
