Query Optimization in Inductive Logic Programming by Reordering Literals
@inproceedings{Struyf2003QueryOI, title={Query Optimization in Inductive Logic Programming by Reordering Literals}, author={Jan Struyf and Hendrik Blockeel}, booktitle={ILP}, year={2003} }
Query optimization is used frequently in relational database management systems. Most existing techniques are 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… CONTINUE READING
Figures, Tables, and Topics from this paper.
Citations
Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS
An Optimised Semantic Web Query Language Implementation in Prolog
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED
Policy-based memoization for ILP-based concept discovery systems
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED
Logic programming for knowledge-intensive interactive applications
VIEW 1 EXCERPT
CITES METHODS
The ACE Data Mining System User's Manual
VIEW 1 EXCERPT
CITES BACKGROUND
A Clause Learning Algorithm Combining Immune Mechanism to Invent Predicate
VIEW 1 EXCERPT
CITES BACKGROUND
A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
Condensed Representations for Inductive Logic Programming
VIEW 1 EXCERPT
CITES BACKGROUND
On the Effect of Caching in Recursive Theory Learning
VIEW 1 EXCERPT
CITES METHODS
References
Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES
Foundations of Logic Programming
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL
Inverse entailment and progol
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL
Compact Representation of Knowledge Bases in ILP
VIEW 1 EXCERPT
Lattice-Search Runtime Distributions May Be Heavy-Tailed
VIEW 1 EXCERPT
Declarative Bias in ILP
VIEW 1 EXCERPT