On the Representation of Infinite Temporal Data and Queries (Extended Abstract)
Summary: Survey and formal comparison of finite representations for infinite temporal predicates, comparing generalized databases (relational+linear repeating time), temporal Datalog (Chomicki & Imielinski) and Templog. Clarifies expressiveness-comparison notions and shows Templog closely related to the Datalog-based language, highlighting differing characterizations (finitely-regular ω-languages vs. periodic sets). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marianne Baudinet (Free University of Brussels)
- 2. Marc Niezette (University of Liège)
- 3. Pierre Wolper (University of Liège)
BibTeX Citation
@inproceedings{baudinet_pods91,
address = {New York, NY, USA},
series = {{PODS} '91},
title = {{On the Representation of Infinite Temporal Data and Queries (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/113413.113439},
doi = {10.1145/113413.113439},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Baudinet, Marianne and Niezette, Marc and Wolper, Pierre},
year = {1991}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 914 | Constraint Programming and Database Languages: A Tutorial | 1995 | PODS | 0.00013104061 |
| 2,711 | Foundations of Data-Aware Process Analysis: A Database Theory Perspective | 2013 | PODS | 8.1038896e-05 |
| 2,937 | Pushing Constraint Selections | 1992 | PODS | 7.8356559e-05 |
| 12,129 | Personal Insights for Altering Decisions of Tree-based Ensembles over Time | 2020 | VLDB | 4.9793485e-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 |
|---|---|---|---|---|
| 4,325 | Polynomial Time Query Processing in Temporal Deductive Databases | 1990 | PODS | 6.6653142e-05 |
| 4,326 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.6640674e-05 |
| 4,438 | Handling Infinite Temporal Data | 1990 | PODS | 6.6000332e-05 |
| 4,537 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS | 6.5550147e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 13,452 | Temporal Relationships in Databases | 1988 | VLDB |
| 2 | 4,325 | Polynomial Time Query Processing in Temporal Deductive Databases | 1990 | PODS |
| 3 | 729 | Logical Modeling Of Temporal Data | 1987 | SIGMOD |
| 4 | 6,017 | Point vs. Interval-based Query Languages for Temporal Databases (Extended Abstract) | 1996 | PODS |
| 5 | 13,385 | A Uniform Approach to Processing Temporal Queries | 1992 | VLDB |
| 6 | 3,054 | A Temporal Relational Algebra as a Basis for Temporal Relational Completeness | 1990 | VLDB |
| 7 | 2,344 | Temporal Logic & Historical Databases | 1991 | VLDB |
| 8 | 4,537 | Temporal Deductive Databases and Infinite Objects | 1988 | PODS |
| 9 | 3,223 | Temporal versus First-Order Logic to Query Temporal Databases | 1996 | PODS |
| 10 | 4,438 | Handling Infinite Temporal Data | 1990 | PODS |