The HiPAC project: combining active databases and timing constraints
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Boundedness is undecidable for datalog programs with a single recursive rule
Information Processing Letters
A theory for rule triggering systems
EDBT '90 Proceedings of the 2nd international conference on extending database technology: Advances in Database Technology
Deriving production rules for constraint maintenance
Proceedings of the sixteenth international conference on Very large databases
Procedural languages for database queries and updates
Journal of Computer and System Sciences
QRT FIFO automata, breadth-first grammars and their relations
Theoretical Computer Science
Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Termination and confluence of rule execution
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Snoop: an expressive event specification language for active databases
Data & Knowledge Engineering
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressiveness issues in active databases (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Managing conflicts between rules (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressiveness issues in active databases
Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Compile-Time and Runtime Analysis of Active Behaviors
IEEE Transactions on Knowledge and Data Engineering
Active Database Rules with Transaction-Conscious Stable-Model Semantics
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Expressiveness and Complexity of Active Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Structural Issues in Active Rule Systems
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Language Constructs for Programming Active Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Composite Event Specification in Active Databases: Model & Implementation
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
An Algebraic Approach to Rule Analysis in Expert Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
NAOS - Efficient and Modular Reactive Capabilities in an Object-Oriented Database System
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Using the Properties of Datalog to Prove Termination and Confluence in Active Databases
RIDS '97 Proceedings of the Third International Workshop on Rules in Database Systems
On Confluence Property of Active Databases with Meta-Rules
RIDS '97 Proceedings of the Third International Workshop on Rules in Database Systems
Large finite structures with few L^k-types
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Active rules termination analysis through conditional formula containing updatable variable
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Refined rules termination analysis through activation path
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Active rules termination analysis based on activation path and enhanced formula
International Journal of Intelligent Information and Database Systems
Hi-index | 5.23 |
Active database systems enhance the functionality of traditional databases through the use of active rules or 'triggers'. One of the principal analysis questions for such systems is that of termination--is it possible for the rules to recursively activate one another indefinitely, given an initial triggering event. In this paper, we study the decidability of the termination problem, our aim being to delimit the boundary between the decidable and the undecidable. We present results for two broad types of variations, variations in rule syntax and variations in meta level features. Within each of these, we identify members close to the boundary of (un)decidability and also look at the effect of combining members of each type. The maximal decidable class we present is capable of expressing some useful kinds of application requirements, such as checking and repairing inclusion constraints. The work is also interesting from a theoretical point of view, since the context is similar to the while query language and the dynamics gives an interesting contrast to Datalog with negation.