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

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

  • Journal of Intelligent Information Systems
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Clause Learning Algorithm Combining Immune Mechanism to Invent Predicate

  • 2007 International Conference on Machine Learning and Cybernetics
  • 2007
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.