Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Słowa kluczowe
Rocznik
Tom
Strony
15--33
Opis fizyczny
Bibliogr. 16 poz.
Twórcy
autor
autor
autor
- Dipartimento di Informatica e Sistemistica, Universita degli Studi di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy, quaglia@dis.uniroma1.it
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPP1-0001-0084