Database Paper Browser

Back to papers

Handling Infinite Temporal Data

Summary: Extension of the relational model encoding infinite temporal data via generalized tuples parameterized by linear repeating points with arithmetic constraints. Proves closure under relational algebra, characterizes expressiveness as Presburger-definable predicates, and gives complexity bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
917
Venue
PODS
Year
1990
Pagerank
7.4913222e-05
Overall Rank
3,136 | 78.19%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2,347 Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases 1989 PODS 8.9890664e-05
3,316 Temporal Deductive Databases and Infinite Objects 1988 PODS 7.2298413e-05
Previous Page 1 / 1 Next

Semantically Similar Papers