This paper describes how semantic object-based concurrency control can bound logical imprecision in the database. It contains a set of sufficient conditions for achieving epsilon serializabilty and proof that they are sufficient. A version has appeared in IEEE Transactions on Knowledge and Data Engineering vol. 9 no. 1.
|