ABSTRACT

A distributed database consists of different number of sites which are interconnected by a communication network. In this environment in absence of proper synchronization among different transaction may lead to inconsistency of databases. A new approach for timestamp ordering problem in serializable schedules is presented. Strict 2PL does not allow all possible serializable schedules and so does not result high throughput. The main advantages of the approach are the ability to enforce the execution of transaction to be recoverable and the high achievable performance of concurrent execution in distributed databases.