DBScholar

Back to papers

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

Summary: Maps the decidability/undecidability frontier for termination of recursively firing active rules, identifying boundary cases in one-literal and unary-update languages. Relates trigger power to while, negated Datalog, boundedness, and query containment. (summarized by gpt-5.6-luna on Jul 21 2026)

Paper ID
1152
Venue
PODS
Year
1998
Pagerank
5.4825743e-05
Overall Rank
8,128 | 44.24%
DOI
10.1145/275487.275517

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bailey_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{Decidability and Undecidability Results for the Termination Problem of Active Database Rules}},
        url = {https://dl.acm.org/doi/10.1145/275487.275517},
        doi = {10.1145/275487.275517},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bailey, James and Dong, Guozhu and Ramamohanarao, Kotagiri},
        year = {1998}
}

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