Database Paper Browser

Back to papers

Decidability and Undecidability Results for the Termination Problem of Active Database Rules

Summary: Delimits decidability boundary for termination of active DB rules by analyzing two restricted families: one-literal (single-atom updates) and unary (only unary updates, higher-arity via views). Identifies tight (un)decidable members and contrasts trigger dynamics with while queries and Datalog negation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1153
Venue
PODS
Year
1998
Pagerank
4.6543275e-05
Overall Rank
7,774 | 45.92%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers