DBScholar

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
916
Venue
PODS
Year
1990
Pagerank
6.7507186e-05
Overall Rank
4,348 | 70.17%
DOI
10.1145/298514.298590

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kabanza_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{Handling Infinite Temporal Data}},
        url = {https://dl.acm.org/doi/10.1145/298514.298590},
        doi = {10.1145/298514.298590},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kabanza, F. and Stevenne, J.-M. and Wolper, P.},
        year = {1990}
}

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,904 Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases 1989 PODS 7.9757931e-05
4,439 Temporal Deductive Databases and Infinite Objects 1988 PODS 6.705288e-05
Previous Page 1 / 1 Next

Semantically Similar Papers