Automatic verification of database transaction safety

Sheard, Tim; Stemple, David

doi:10.1145/68012.68014

Cited by 93 publications

(35 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since semantic integrity control usually involves queries on large amounts of data, two kinds of optimization techniques have been proposed: first, to prove at compile-time that update transactions cannot violate certain given integrity constraints [4,15,30], and second to reduce the complexity of the remaining queries at run-time [17,31,32,33]. While the strategies for run-time integrity control optimization focus on query simplification for integrity checks, our protocol focuses on the concurrent execution of integrity checks.…”

Section: Relation To Other Work and Our Focusmentioning

confidence: 99%

Concurrent Checking of Global Cross-Database Integrity Constraints

Böttcher

2003

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Global integrity of data across the boundaries of single database systems is an important requirement in multi-database systems, but cannot be achieved without transaction synchronization across the boundaries of database systems.The problem is to guarantee that global transactions leave these multiple databases in a globally consistent state and to avoid that global integrity checks unnecessarily block other application transactions. We present a solution that offers both, unlimited concurrency between global integrity constraint checks and local transactions, and increased concurrency of global integrity checks and global application transactions, thereby contributing to a higher performance of global integrity checks. We show that the key idea of our approach, i.e., to lock the integrity constraint itself, leads to a correct and efficiently implementable lock protocol for concurrent integrity constraint checks crossing database system boundaries. Since our approach blocks significantly less resources for global integrity checking than the conventional approach, we consider it to be an important contribution to guarantee global cross-database integrity.

show abstract

Section: Relation To Other Work and Our Focusmentioning

confidence: 99%

Concurrent Checking of Global Cross-Database Integrity Constraints

Böttcher

2003

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…Our verification framework is inspired by the pioneering work of Sheard and Stemple [27], which applies automated theorem proving techniques to the verification of transaction safety in the context of relational databases. Our work address a number of issues that do not arise in relational databases, such as object sharing, object creation, inheritance and heterogeneity.…”

Section: Related Work and Extensionsmentioning

confidence: 99%

Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model

Spelt

Even

2001

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYCompensation plays an important role in advanced transaction models, cooperative work and workflow systems. A schema designer is typically required to supply for each transaction T another transaction T −1 to semantically undo the effects of T . Little attention has been paid to the verification of the desirable properties of such operations, however. This paper demonstrates the use of a higher-order logic theorem prover for verifying that compensating transactions return a database to its original state. It is shown how an OODB schema is translated to the language of the theorem prover so that proofs can be performed on the compensating transactions.

show abstract

“…A large number of different issues has been covered, for instance semantic integrity constraints design [23], transaction correctness w.r.t. integrity constraint [24][25][26] and repair of constraint violation [27,28]. For active databases, compiling constraints into ECA rules has been investigated [29][30][31].…”

Section: Related Workmentioning

confidence: 99%

Consistency management in object‐oriented databases

Oakasha

Conrad²,

Saake

2001

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe paper presents concepts and ideas underlying an approach for consistency management in objectoriented (OO) databases. In this approach constraints are considered as first class citizens and stored in a meta-database called constraints catalog. When an object is created constraints of this object are retrieved from the constraints catalog and relationships between these constraints and the object are established. The structure of constraints has several features that enhance consistency management in OO database management systems which do not exist in conventional approaches in a satisfactory way. This includes: monitoring object consistency at different levels of update granularity, integrity independence, and efficiency of constraints maintenance; controlling inconsistent objects; enabling and disabling constraints, globally to all objects or locally to individual objects; and declaring constraints on individual objects. All these features are provided by means of basic notations of OO data models.

show abstract

Automatic verification of database transaction safety

Cited by 93 publications

References 16 publications

Concurrent Checking of Global Cross-Database Integrity Constraints

Concurrent Checking of Global Cross-Database Integrity Constraints

Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model

Consistency management in object‐oriented databases

Contact Info

Product

Resources

About