By Topic

Formal model for verifying compatibility among transactions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. A. Farrag ; Dept. of Math. & Comput. Sci., Dalhousie Univ., Halifax, NS, Canada ; J. Abawajy

One major problem common to all semantic-based concurrency control systems that have been previously proposed is that of verifying that the allowable (nonserializable) schedules are mutually consistent. In all proposed methods, the verification was assumed to be done by the user. This assumption is both risky and unreasonable for complex database applications. Thus, a formal model is needed so that the verification can be performed by the system. The authors examine this problem. First, they develop a general model for utilizing semantic knowledge. Then, they develop a verification model based on the notion of compatibility among transactions. Their model shows that optimizing the verification is a difficult (NP-Hard) problem. Several near-optimal algorithms for performing the verification in polynomial time are also presented

Published in:

System Theory, 1994., Proceedings of the 26th Southeastern Symposium on

Date of Conference:

20-22 Mar 1994