Induction of relational algebra expressions

  • Authors:
  • Joris J. M. Gillis;Jan Van den Bussche

  • Affiliations:
  • Universiteit Hasselt and transnationale Universiteit Limburg;Universiteit Hasselt and transnationale Universiteit Limburg

  • Venue:
  • ILP'09 Proceedings of the 19th international conference on Inductive logic programming
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problemof inducing relational databases queries expressing quantification. Such queries express interesting multi-relational patterns in a database in a concise manner. Queries on relational databases can be expressed as Datalog programs. Inducing Datalog programs expressing quantification requires both negation and predicate invention. Predicate invention has been studied in the ILP literature. However, we propose a radical new approach to inducing quantification. We express queries in the relational algebra and we perform a heuristic search for the desired expression. A heuristic, which takes the complement operator into account, is proposed. We report some preliminary experimental results of a software prototype implementing our ideas. The results are compared with the results of FOIL and Tilde on the same examples.