A formal characterization of epsilon serializability

K., Ramamritham ; C., Pu (1995) A formal characterization of epsilon serializability IEEE Transactions on Knowledge and Data Engineering, 7 (6). pp. 997-1007. ISSN 1041-4347

PDF - Author Version

Official URL: http://ieeexplore.ieee.org/search/freesrchabstract...

Related URL: http://dx.doi.org/10.1109/69.476504


Epsilon serializability (ESR) is a generalization of classic serializability (SR). In this paper, we provide a precise characterization of ESR when queries that may view inconsistent data run concurrently with consistent update transactions. Our first goal is to understand the behavior of queries in the presence of conflicts and to show how ESR in fact is a generalization of SR. So, using the ACTA framework, we formally express the intertransaction conflicts that are recognized by ESR and through that define ESR, analogous to the manner in which conflict-based serializability is defined. Secondly, expressions are derived for the amount of inconsistency (in a data item) viewed by a query and its effects on the results of a query. These inconsistencies arise from concurrent updates allowed by ESR. Thirdly, in order to maintain the inconsistencies within bounds associated with each query, the expressions are used to determine the preconditions that operations have to satisfy. The results of a query, and the errors in it, depend on what a query does with the (possibly inconsistent) data viewed by it. One of the important byproducts of this work is the identification of different types of queries which lend themselves to an analysis of the effects of data inconsistency on the results of the query.

Item Type:Article
Source:Copyright of this article belongs to IEEE.
Keywords:Epsilon Serializability; Concurrency Control; Transaction Processing; Formal Techniques; ACTA
ID Code:62912
Deposited On:24 Sep 2011 05:12
Last Modified:18 May 2016 11:58

Repository Staff Only: item control page