Issue No. 06 - December (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.476504
<p><it>Abstract</it>—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 <it>consistent</it> update transactions.</p><p>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) <it>viewed</it> by a query and its effects on the <it>results</it> 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 <it>preconditions</it> 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.</p>
Epsilon serializability, concurrency control, transaction processing, formal techniques, ACTA.
C. Pu and K. Ramamritham, "A Formal Characterization of Epsilon Serializability," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 997-1007, 1995.