Year: 1989
Type: article
Abstract: 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.
Source: ACM SIGACT News
DOI: 10.1145/74074.74077
Authors: P. Kanellakis, S. Abiteboul
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W3142976553