Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/93499| Title: | ThespisTRX : causally-consistent read transactions |
| Authors: | Vella, Joseph G. Nezval, Vitezslav Camilleri, Carl |
| Keywords: | Database management Middleware Actor (Computer program language) Distributed databases Database design Relational databases |
| Issue Date: | 2020 |
| Publisher: | IGI Global |
| Citation: | Camilleri, C., Vella, J. G., & Nezval, V. (2020). ThespisTRX: Causally-consistent read transactions. International Journal of Information Technology and Web Engineering (IJITWE), 15(1), 1-16. |
| Abstract: | Data consistency defines how usable a data set is. Causal consistency is the strongest type of consistency that can be achieved when data is stored in multiple locations, and fault tolerance is desired. Thespis is a middleware that innovatively leverages the Actor model to implement causal consistency over a DBMS, whilst abstracting complexities for application developers behind a REST interface. Following the evaluation of correctness, performance and scalability of Thespis, it is illustrated how a business application can be guaranteed causal consistency, but still encounter Time-To-Check-Time-To-Use (TOCTOU) race conditions. The design and implementation of ThespisTRX is given, which builds upon, and extends, the Thespis middleware to offer read-only transaction capabilities, allowing clients to read a causally-consistent version of multiple data entities. A correctness analysis illustrates how ThespisTRX avoids TOCTOU race conditions, and empirical performance tests show that this can be achieved with minimal overheads. Article Preview |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/93499 |
| Appears in Collections: | Scholarly Works - FacICTCIS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ThespisTRX_Causally_consistent_read_transactions(2020).pdf Restricted Access | 759.13 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.
