An algebraic approach to static analysis of active database rules
Rules in active database systems can be very difficult to program due to the unstructured and unpredictable nature of rule processing. We provide static analysis techniques for predicting whether a given rule set is guaranteed to terminate and whether rule execution is confluent (guaranteed to have...
Saved in:
Published in | ACM transactions on database systems Vol. 25; no. 3; pp. 269 - 332 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY, USA
ACM
01.09.2000
Association for Computing Machinery, Inc Association for Computing Machinery |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!