Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database

Author

Karadimce, Anton P. ; Urban, Susan D.

Author_Institution

Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA

fYear

1996

fDate

26 Feb-1 Mar 1996

Firstpage

384

Lastpage

391

Abstract

Presents the notion of refined triggering graphs (RTG) for analyzing termination of active rules in object-oriented databases (OODBs). The RTG method consists of mapping the possibility that one active rule can trigger another to the satisfiability of a well-defined logic formula called a triggering formula. The unsatisfiability of the triggering formula is then an indication that the rule triggering possibility is nil. We identify three increasingly more powerful types of triggering formulae and give pointers to the corresponding satisfiability procedures

Keywords

active databases; computability; database theory; formal logic; graph theory; object-oriented databases; active object-oriented database; active rules termination; logic-based approach; refined triggering graphs; rule triggering possibility; satisfiability procedures; termination analysis; triggering formula; Access control; Computer science; Concrete; Data engineering; Data models; Equations; Joining processes; Logic; Object oriented databases; Sufficient conditions;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1996. Proceedings of the Twelfth International Conference on

Conference_Location

New Orleans, LA

ISSN

1063-6382

Print_ISBN

0-8186-7240-4

Type

conf

DOI

10.1109/ICDE.1996.492187

Filename

492187