Database Paper Browser

Back to papers

Relational Specifications of Infinite Query Answers

Summary: Extends Datalog with functional rules to model infinite query answers; least fixpoints may be infinite. Represents infinite least fixpoints by finite relational specifications: a finite tuple set plus a congruence relation, applicable to domain-independent rule sets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2438
Venue
SIGMOD
Year
1989
Pagerank
6.7004022e-05
Overall Rank
3,853 | 73.20%
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
1,051 Safety of Recursive Horn Clauses With Infinite Relations 1987 PODS 0.00014440736
3,316 Temporal Deductive Databases and Infinite Objects 1988 PODS 7.2298413e-05
Previous Page 1 / 1 Next

Semantically Similar Papers