Database Paper Browser

Back to papers

Chase Termination Beyond Polynomial Time

Summary: New chase termination criterion tolerates some cycles, yet guarantees termination under reasonable conditions. Expands decidable tgd fragments beyond existing acyclicity, with k-ExpTime data complexity; enables optimized chase for PSpace or k-ExpSpace entailment. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1924
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,908 | 24.12%
DOI
10.1145/3651594

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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