Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/93704
Title: ThespisTRX : initial results for causally-consistent read transactions
Authors: Vella, Joseph G.
Nezval, Vitezslav
Camilleri, Carl
Keywords: Middleware
Actor (Computer program language)
Distributed databases
Database management
Database design
Issue Date: 2018-02
Publisher: Springer
Citation: Camilleri, C., Vella, J. G., & Nezval, V. (2018). ThespisTRX: initial results for causally-consistent read transactions. International Conference on Information Systems and Management Science, Malta. 1-18.
Abstract: Data Consistency defines how usable a data set is, and different levels of data consistency have been proposed. Causal consistency is one of these. It 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, in this paper the authors illustrate how a business application can be guaranteed causal consistency, but still encounter Time-To-Check-Time-To-Use (TOCTOU) race conditions. The authors subsequently present the design of ThespisTRX, 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 the design avoids TOCTOU race conditions, and empirical tests show the efficacy of the approach.
URI: https://www.um.edu.mt/library/oar/handle/123456789/93704
Appears in Collections:Scholarly Works - FacICTCIS

Files in This Item:
File Description SizeFormat 
ThespisTRX_Initial_results_for_causally_consistent_read_transactions(2018).pdf
  Restricted Access
400.54 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.