An Axiomatic Approach to Deciding Query Safety in Deductive Databases
Summary: Propose supersafety for Horn-clause queries by abstracting function symbols into infinite relations with finiteness constraints. Prove supersafety is axiomatizable and decidable, yielding an effective decision procedure that captures a large, nontrivial subset of safe queries. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Kifer (State University of New York at Stony Brook)
- 2. Raghu Ramakrishnan (University of Wisconsin)
- 3. Avi Silberschatz (University of Texas)
BibTeX Citation
@inproceedings{kifer_pods88,
address = {New York, NY, USA},
series = {{PODS} '88},
title = {{An Axiomatic Approach to Deciding Query Safety in Deductive Databases}},
url = {https://dl.acm.org/doi/10.1145/308386.308412},
doi = {10.1145/308386.308412},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kifer, Michael and Ramakrishnan, Raghu and Silberschatz, Avi},
year = {1988}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,910 | Automata Theory for Database Theoreticians | 1989 | PODS | 9.3895837e-05 |
| 2,631 | Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract) | 1989 | PODS | 8.2007667e-05 |
| 3,906 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS | 6.9303314e-05 |
| 4,318 | Safe Constraint Queries | 1998 | PODS | 6.6649452e-05 |
| 4,428 | Languages for Relational Databases over Interpreted Structures | 1997 | PODS | 6.6007489e-05 |
| 6,206 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS | 5.8479648e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 67 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00037991902 |
| 159 | Inclusion dependencies and their interaction with functional dependencies (Extended abstract) | 1982 | PODS | 0.00027945388 |
| 177 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00026648806 |
| 1,536 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS | 0.00010326412 |
| 2,099 | Functional and Inclusion Dependencies: A Graph Theoretic Approach | 1984 | PODS | 9.0478598e-05 |
| 2,165 | Improving Database Schemes by Adding Attributes | 1983 | PODS | 8.9307749e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,661 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 2 | 8,682 | Checking Consistency of Database Constraints: a Logical Basis | 1986 | VLDB |
| 3 | 13,522 | Coping with Complexity in Automated Reasoning about Database Systems | 1985 | VLDB |
| 4 | 177 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS |
| 5 | 3,584 | Query Processing in Deductive Databases with Incomplete Information | 1986 | SIGMOD |
| 6 | 6,412 | Finite Queries do not Have Effective Syntax | 1995 | PODS |
| 7 | 6,206 | Safety of Datalog Queries over Infinite Databases | 1989 | PODS |
| 8 | 4,326 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD |
| 9 | 4,318 | Safe Constraint Queries | 1998 | PODS |
| 10 | 1,536 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS |