loading...
Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database
New Orleans, Louisiana February 26-March 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.1996.49218712th International Conference on Data ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Anton P. Karadimce, Susan D. Urban, "Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database," Data Engineering, International Conference on, pp. 384, 12th International Conference on Data Engineering (ICDE'96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/ICDE.1996.492187,
author = {Anton P. Karadimce and Susan D. Urban},
title = {Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database},
journal ={Data Engineering, International Conference on},
volume = {0},
year = {1996},
issn = {1063-6382},
pages = {384},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.1996.492187},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Engineering, International Conference on
TI - Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database
SN - 1063-6382
SP
EP
A1 - Anton P. Karadimce,
A1 - Susan D. Urban,
PY - 1996
VL - 0
JA - Data Engineering, International Conference on
ER -
 
Anton P. Karadimce, Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Susan D. Urban, Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
We present 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.
Citation:
Anton P. Karadimce, Susan D. Urban, "Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database," icde, pp.384, 12th International Conference on Data Engineering (ICDE'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.