PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finding nonrecursive envelopes for Datalog predicate
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
Theoretical Computer Science
First-Order Logic Characterization of Program Properties
IEEE Transactions on Knowledge and Data Engineering
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
| Hi-index | 0.00 |
The study of database logic programs, popularly known as Datalog programs, is one of the principal research themes in database theory today. Datalog is the simplest formalism available for describing rule-based programming and, thus, of interest to the larger computer science community. A key optimization problem is to estimate the depth of recursion of a database logic program, as a function of the size of its input database. Deciding bounded recursion for a given program, i.e., determining whether its depth of recursion is bounded by a constant independent of the input, turns out to be a basic and surprisingly subtle task. In the first database theory column, we review the progress made on understanding bounded recursion and list some of the outstanding open questions. For the readers, who are not familiar with the terminology, we include the relevant definitions.