On Correctness of Nonserializable Executions

摘要

In a number of application environments (e.g., computer aided design),serializability, the traditionally accepted notion of correctness has been found to be too restrictive, and a number of alternate criteria have been proposed in the literature. One such criterion ispredicate-wise serializability(PWSR) which requires only restrictions of schedules that access subsets of the database over which integrity constraints are defined to be serializable. In this paper, we identify restrictions on the structure of transaction programs, their concurrent execution, and their access characteristics under which PWSR schedules preserve database consistency.