A graph testing concurrency control protocol for object bases

Presents a protocol for concurrency control in object bases. The object bases model of Hadzilacos and Hadzilacos (1991) is used as a framework to describe the protocol and to derive a proof of correctness. The protocol accepts all correct executions. A definition of order preserving serializability suitable for the model is also presented. A slight modification of the protocol ensures that the produced executions obeys the defined order-preserving serializability. The protocol detects inconsistencies by constructing a graph for each node of the nested execution and testing its acyclicity.<
>