Polynomial Time Query Processing in Temporal Deductive Databases
Summary: Shows that if temporal rules induce least models with period polynomial in database size then yes–no queries (and finite representations of all answers) are computable in polynomial time, and gives a bottom-up algorithm BT that terminates under this criterion. Since polynomial periodicity is not directly decidable, defines decidable inflationary and undecidable I-periodicity, and proposes a syntactic multi-separability approximation to capture tractable cases. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jan Chomicki
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 618 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00018990567 |
| 2,870 | Pushing Constraint Selections | 1992 | PODS | 7.9840692e-05 |
| 4,124 | On the Representation of Infinite Temporal Data and Queries (Extended Abstract) | 1991 | PODS | 6.4281002e-05 |
| 9,813 | Optimizing Nested Recursive Queries | 2024 | SIGMOD | 4.2742278e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 375 | PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) | 1988 | PODS | 0.00025262028 |
| 552 | Why Not Negation By Fixpoint? | 1988 | PODS | 0.00020309855 |
| 3,318 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS | 7.2227559e-05 |
| 3,856 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.6938945e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,935 | Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation | 1990 | SIGMOD | 4.1905499e-05 |
| 9,843 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS | 4.2680295e-05 |
| 12,976 | Temporal Relationships in Databases | 1988 | VLDB | 4.1905499e-05 |
| 2,765 | Temporal versus First-Order Logic to Query Temporal Databases | 1996 | PODS | 8.1563487e-05 |
| 12,911 | A Uniform Approach to Processing Temporal Queries | 1992 | VLDB | 4.1905499e-05 |
| 4,124 | On the Representation of Infinite Temporal Data and Queries (Extended Abstract) | 1991 | PODS | 6.4281002e-05 |
| 6,035 | On Datalog vs. Polynomial Time | 1991 | PODS | 5.2365238e-05 |
| 4,522 | A Temporal-Probabilistic Database Model for Information Extraction | 2013 | VLDB | 6.1109228e-05 |
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 3,318 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS | 7.2227559e-05 |