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 is predicate- wise serializability (PWSR) which requires only restrictions of schedu les that access subsets of the database over which integrity constrain ts are defined to be serializable. In this paper, we identify restrict ions on the structure of transaction programs, their concurrent execut ion, and their access characteristics under which PWSR schedules prese rve database consistency. (C) 1998 Academic Press.