The ticket-based concurrency control allows the management of indirect conflicts between multidatabase transactions without violating site autonomy and ensuring global serializability. In this paper, by using discrete event simulation models, we compare two global concurrency control algorithms: the Optimistic Ticket Method (OTM) and the Multidatabase Timestamp Mechanism (MTSM). Performance of those algorithms strongly depend on the local concurrency control scheme at each site. Hence, we propose two optimizations of MTSM: one for the case of timestamp-based local concurrency control, the other for the case of optimistic local concurrency control. The proposed solutions reduce the ticket contention improving performance.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.