Abstract
We study the problem of 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley Publishing Company Inc., Reading (1995)
Ullman, J.: Principles of Database and Knowledge-Base Systems, vol. 1. Computer Science Publisher, Rockville (1988)
Ullman, J.: Principles of Database and Knowledge-Base Systems, vol. 2. Computer Science Publisher, Rockville (1989)
Blockeel, H., De Raedt, L.: Relational knowledge discovery in databases (1996)
Blockeel, H., De Raedt, L.: Inductive database design (1996)
Codd, E.: Relational completeness of data base sublanguages. Database Systems (1972)
Chandra, A., Harel, D.: Structure and complexity of relational queries. Journal of Computer and System Sciences 25, 99–128 (1982)
Silverstein, G., Pazzani, M.: Relational clichés: Constraining induction during relational learning (1991)
Kijsirikul, B., Numao, M., Shimura, M.: Discrimination-based constructive induction of logic programs (1992)
Kok, S., Domingos, P.: Statistical predicate invention (2007)
Quinlan, J., Cameron-Jones, R.: Induction of logic programs: Foil and related systems. New Generation Computing 13, 287–312 (1995)
Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artificial Intelligence 101, 285–297 (1998)
De Raedt, L.: Logical and Relational Learning. In: Cognitive Technologies. Springer, Heidelberg (2008)
Acar, A., Motro, A.: Intensional encapsulation of database subsets via genetic programming (2005)
Miller, R., Haas, L., Hernández, M.: Schema mapping as query discovery (2000)
Fletcher, G., Wyss, C.: Data mapping as search. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 95–111. Springer, Heidelberg (2006)
Henkin, L., Monk, J., Tarski, A.: Cylindric Algebras, Part I. North-Holland, Amsterdam (1971)
Van den Bussche, J.: Applications of alfred tarski’s ideas in database theory (2001)
Imielinski, T., Lipski, W.: The relational model of data and cylindric algebras. Journal of Computer and System Sciences 28, 80–102 (1984)
Kahr, A., Moore, E., Wang, H.: Entscheidungsproblem recuded to the ∀ ∃ ∀ case. Proc. Natl. Acad. Sci. USA 48, 365–377 (1962)
Russell, S., Norvig, P.: Artificial Intelligence, A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2003)
Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Raons, J., Vandecasteele, H.: Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research 16, 135–166 (2002)
Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gillis, J.J.M., Van den Bussche, J. (2010). Induction of Relational Algebra Expressions. In: De Raedt, L. (eds) Inductive Logic Programming. ILP 2009. Lecture Notes in Computer Science(), vol 5989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13840-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13840-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13839-3
Online ISBN: 978-3-642-13840-9
eBook Packages: Computer ScienceComputer Science (R0)