MultidatabaseTransactionManagement.pptVIP

* * * * * * * * Multidatabase Transaction Management More Concurrency – Using Tickets “Forcing Conflicts” works if the global transactions are executed serially If they are executed concurrently, we need to ensure that the local schedules are consistent We cannot have “Ti→Tj” at one site, and “Tj→Ti” at another site. This can be achieved using a special data item, ticket, at each site Multidatabase Transaction Management Ticket A ticket is maintained at each local site Each global transaction executing at a site reads the ticket value increment it, and update the ticket value A ticket value indicates the serialization order of a global transaction at a site Multidatabase Transaction Management Ticket – Optimistic Approach The GTM keeps a serialization graph for all active global transactions (started but not committed) When transaction T reads ticket value t at site Si , an arc is entered from every transaction that reads a ticket less than t at Si to T. (This serialization graph can be maintained by the GTM) If T completes all of its actions and is not involved in a cycle, it is committed, or else it is aborted Multidatabase Transaction Management Ticket - Pessimistic Approach Global transactions are assigned a priori a global serialization order, and the tickets they should read are determined in advance If a transaction submits its operation outside of a local-site ticket order, it waits. ? no cycle in the serialization graph ! Multidatabase Transaction Management Optimistic vs. Pessimistic Optimistic method may lead to many aborted transactions Pessimistic method may lead to low concurrency Same problem exists with most other techniques An inherent problem in trying to achieve global serializability with autonomous sites. * * * * * * * * * * * * * * * * * * * * * * * * * * * Multidatabase Transaction Management Multidatabase Transaction Management COP5711 Multidatabase Transaction Management Outline Review - Transaction Processing Multidatabase Transacti