The concurrency control problem for database systems (Q790627)

Synchronization anomalies in database systems and their avoidance techniques are discussed in the book. Two different broad scenarios are considered. The first one deals with general purpose database systems supporting any transaction mix accessing any database. Solutions are given by schedulers having arbitrary access to the database. These scheduling algorithms, however, are fundamentally different from those known from classical scheduling theory and even from the case of operating systems. The main difference is that transactions cannot be scheduled in advance, but rather become known as the scheduling evolves. The second part of the book deals with update-intensive transaction systems characterized by a known set of transactions accessing a fixed database. Solutions are given by tools and techniques to describe synchronization strategies, state their correctness criteria and verify their adequacy. Its basic vehicle is a data manipulation language extending First Order Dynamic Logic.