Data independent recursion in deductive databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A decidable class of bounded recursions
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming and parallel complexity
Foundations of deductive databases and logic programming
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Boundedness is undecidable for datalog programs with a single recursive rule
Information Processing Letters
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Proceedings of the 30th IEEE symposium on Foundations of computer science
Decidability and undecidability results for boundedness of linear recursive queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On computing restricted projections of representative instances
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Some Positive Results for Boundedness of Multiple Recursive Rules
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Halting Problem of One Binary Horn Clause is Undecidable
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
A time bound on the materialization of some recursively defined views
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Recurrence with affine level mappings is p-time decidable for clp$({\mathbb r})$
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
DATALOG is the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is uniformly bounded. Since uniformly bounded programs can be executed in parallel constant time, the possibility of automated boundedness detection is an important issue, and has been studied in many papers. In this paper we solve one of the most famous open problems in the theory of deductive databases (see e.g. P.C. Kanellakis, Elements of Relational Database Theory in Handbook of Theoretical Computer Science) showing that uniform boundedness is undecidable for single rule programs (called also sirups).