By Topic

Designing consistency-preserving database 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
$31 $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

1 Author(s)
Liebelt, C. ; Inst. of Parallel & Distributed Super Comput., Stuttgart Univ., West Germany

Transaction programs by definition have to maintain all consistency constraints defined on a database. Although the overall operational consistency of a database rests on this crucial assumption, there are few design aids to support the design of consistent transaction programs. An approach is presented for verifying that the defined integrity constraints are not violated by a transaction program. Assuming that the database is in a consistent state before the transaction program starts, the database stays consistent after the execution of a correct transaction program. In this approach all computations and all modifications on the database are identified and represented with symbolic values. The symbolic representation of the output variables and database operations is used to verify the integrity constraints. Therefore, it is possible to support the application programmer in designing correct transaction programs

Published in:

Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International

Date of Conference:

20-22 Sep 1989