Abstract:The influence of useless actions on testing serializability of a schedule is discussed in this paper. At first, we define the write-write^ write-read^ read-write and read-read constraints. It is shown that if there is no useless actions in the schedule, the complexity of testing serializability under the constraints is in polinomial time. We extend the problems to the multiversion systems, then some good conclusions polynomial are obtained.