Safety of Recursive Horn Clauses With Infinite Relations

Summary: Decidability: safety of recursive pure Horn-clause queries becomes decidable when function-symbol terms are modeled as distinct uninterpreted infinite predicates constrained by finiteness dependencies. Also gives a sufficient safety criterion under monotonicity constraints. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 806
Venue: PODS
Year: 1987
Pagerank: 0.00010567892
Overall Rank: 1,498 | 89.73%
DOI: 10.1145/28659.28694

Incoming Non-self Citations Over Time

Authors

1. Raghu Ramakrishnan (Microelectronics And Technology Computer Corporation; University of Texas)
2. Francois Bancilhon (Microelectronics And Technology Computer Corporation)
3. Avi Silberschatz (University of Texas)

BibTeX Citation

@inproceedings{ramakrishnan_pods87,
        address = {New York, NY, USA},
        series = {{PODS} '87},
        title = {{Safety of Recursive Horn Clauses With Infinite Relations}},
        url = {https://dl.acm.org/doi/10.1145/28659.28694},
        doi = {10.1145/28659.28694},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ramakrishnan, Raghu and Bancilhon, Francois and Silberschatz, Avi},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,856	Automata Theory for Database Theoreticians	1989	PODS	9.6053834e-05
2,579	Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract)	1989	PODS	8.3906191e-05
3,025	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS	7.8386928e-05
3,355	A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract)	1988	SIGMOD	7.4912272e-05
3,824	Inference of Inequality Constraints in Logic Programs (Extended Abstract)	1991	PODS	7.0919497e-05
4,226	Safe Constraint Queries	1998	PODS	6.8211482e-05
4,235	Relational Specifications of Infinite Query Answers	1989	SIGMOD	6.8167527e-05
4,439	Temporal Deductive Databases and Infinite Objects	1988	PODS	6.705288e-05
6,077	Safety of Datalog Queries over Infinite Databases	1989	PODS	5.9850223e-05
6,155	Safety and Translation of Calculus Queries with Scalar Functions (Extended Abstract)	1993	PODS	5.9566466e-05
6,307	Optimizing Existential Datalog Queries	1988	PODS	5.9196585e-05
6,649	Reasoning about Strings in Databases	1994	PODS	5.8146334e-05

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 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	CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract)	1986	PODS	0.00012406675

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,512	Query Processing in Deductive Databases with Incomplete Information	1986	SIGMOD
2	2,904	Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases	1989	PODS
3	344	On the Power of Magic	1987	PODS
4	6,926	On the Decidability of Containment of Recursive Datalog Queries - Preliminary report	2004	PODS
5	63	An Amateur's Introduction to Recursive Query Processing Strategies	1986	SIGMOD
6	4,226	Safe Constraint Queries	1998	PODS
7	6,286	Finite Queries do not Have Effective Syntax	1995	PODS
8	6,077	Safety of Datalog Queries over Infinite Databases	1989	PODS
9	4,235	Relational Specifications of Infinite Query Answers	1989	SIGMOD
10	3,025	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS