Database Paper Browser

Back to papers

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)

Paper ID
945
Venue
PODS
Year
1991
Pagerank
6.4343963e-05
Overall Rank
4,123 | 71.32%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
620 Constraint Programming and Database Languages: A Tutorial 1995 PODS 0.00019005954
1,928 Foundations of Data-Aware Process Analysis: A Database Theory Perspective 2013 PODS 0.00010061483
2,861 Pushing Constraint Selections 1992 PODS 7.9919152e-05
11,634 Personal Insights for Altering Decisions of Tree-based Ensembles over Time 2020 VLDB 4.1945683e-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
3,136 Handling Infinite Temporal Data 1990 PODS 7.4913222e-05
3,316 Temporal Deductive Databases and Infinite Objects 1988 PODS 7.2298413e-05
3,767 Polynomial Time Query Processing in Temporal Deductive Databases 1990 PODS 6.7783966e-05
3,853 Relational Specifications of Infinite Query Answers 1989 SIGMOD 6.7004022e-05
Previous Page 1 / 1 Next

Semantically Similar Papers