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 (University of North Carolina)
BibTeX Citation
@inproceedings{chomicki_pods90,
address = {New York, NY, USA},
series = {{PODS} '90},
title = {{Polynomial Time Query Processing in Temporal Deductive Databases}},
url = {https://dl.acm.org/doi/10.1145/298514.298589},
doi = {10.1145/298514.298589},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Chomicki, Jan},
year = {1990}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 889 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013398105 |
| 2,876 | Pushing Constraint Selections | 1992 | PODS | 8.0075966e-05 |
| 4,536 | On the Representation of Infinite Temporal Data and Queries (Extended Abstract) | 1991 | PODS | 6.641885e-05 |
| 9,960 | Optimizing Nested Recursive Queries | 2024 | SIGMOD | 5.1879626e-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 |
|---|---|---|---|---|
| 702 | PROCEDURAL AND DECLARATIVE DATABASE UPDATE LANGUAGES (Extended Abstract) | 1988 | PODS | 0.00014855299 |
| 989 | Why Not Negation By Fixpoint? | 1988 | PODS | 0.00012804792 |
| 4,235 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.8167527e-05 |
| 4,439 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS | 6.705288e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,120 | Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation | 1990 | SIGMOD |
| 2 | 9,994 | Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints | 2025 | PODS |
| 3 | 13,162 | Temporal Relationships in Databases | 1988 | VLDB |
| 4 | 3,171 | Temporal versus First-Order Logic to Query Temporal Databases | 1996 | PODS |
| 5 | 13,095 | A Uniform Approach to Processing Temporal Queries | 1992 | VLDB |
| 6 | 4,536 | On the Representation of Infinite Temporal Data and Queries (Extended Abstract) | 1991 | PODS |
| 7 | 6,209 | On Datalog vs. Polynomial Time | 1991 | PODS |
| 8 | 4,556 | A Temporal-Probabilistic Database Model for Information Extraction | 2013 | VLDB |
| 9 | 7,886 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 10 | 4,439 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS |