Title: Query optimization in inductive logic programming by reordering literals
Authors: Struyf, Jan ×
Blockeel, Hendrik #
Issue Date: 2003
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2835 pages:329-346
Conference: International Conference on Inductive Logic Programming edition:13 location:Szeged, Hungary date:September 29 - October 1, 2003
Abstract: Query optimization is used frequently in relational database management systems. Most existing techniques axe based on reordering the relational operators, where the most selective operators are executed first. In this work we evaluate a similar approach in the context of Inductive Logic Programming (ILP). There are some important differences between relational database management systems and ILP systems. We describe some of these differences and list the resulting requirements for a reordering transformation suitable for ILP. We propose a transformation that meets these requirements and an algorithm for estimating the computational cost of literals, which is required by the transformation. Our transformation yields a significant improvement in execution time on the Carcinogenesis data set.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
40846.pdf Published 232KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science