(Enter summary)
Abstract: 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 di#erences
between relational database management systems and ILP systems. We
describe some of these di#erences and list the resulting requirements for
a... (Update)
Cited by: More
Ecient Theta-subsumption of Sets of Patterns - Jan Ramon And (2004)
(Correct)
Query Optimization: Combining Query Packs - And The Once-Transformation
(Correct)
Fast Relational Data Mining - Query Optimization For
(Correct)
Active bibliography (related documents): More All
1.5: Query Optimization in Inductive Logic - Programming By Reordering
(Correct)
0.5: Scalability and Efficiency in Multi-Relational Data Mining - Blockeel, Sebag (2003)
(Correct)
0.3: Compact representation of Knowledge Bases in.. - Struyf, Ramon.. (2004)
(Correct)
Similar documents based on text: More All
0.5: Efficient Multi-Relational Data Mining - Struyf, Blockeel
(Correct)
0.4: Efficient Cross-validation in ILP - Struyf, Blockeel (2001)
(Correct)
0.4: First Order Alternating Decision Trees - Vanassche, Krzywania, Vaneyghen..
(Correct)
Related documents from co-citation: More All
4: Query transformations for improving the eciency of ILP systems (context) - Costa, Srinivasan et al. - 2002
4: Top-down induction of rst order logical decision trees (context) - Blockeel, De Raedt - 1998
2: An assessment of ILP-assisted models for toxicology and the PTE-3 experiment
- Srinivasan, King et al. - 1999
BibTeX entry: (Update)
J. Struyf and H. Blockeel. Query optimization in inductive logic programming by reordering literals. In Proceedings of the 13th International Conference on Inductive Logic Programming, Lecture Notes in Arti cial Intelligence. Springer-Verlag, 2003. To appear. http://citeseer.ist.psu.edu/struyf03query.html More
@misc{ struyf03query,
author = "J. Struyf and H. Blockeel",
title = "Query optimization in inductive logic programming by reordering literals",
text = "J. Struyf and H. Blockeel. Query optimization in inductive logic programming
by reordering literals. In Proceedings of the 13th International Conference
on Inductive Logic Programming, Lecture Notes in Arti cial Intelligence.
Springer-Verlag, 2003. To appear.",
year = "2003",
url = "citeseer.ist.psu.edu/struyf03query.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
492
Learning logical definitions from relations (context) - Quinlan - 1990
481
Fundamentals of Database Systems (context) - Elmasri, Navathe - 1989
127
Query optimization in database systems (context) - Jarke, Koch - 1984
55
Special issue on Inductive Logic Programming (context) - Muggleton, Progol et al. - 1995
27
and other implementation issues in the WAM (context) - Carlsson, indexing - 1987
22
Scaling up inductive logic programming by learning from inte..
- Blockeel, De Raedt et al. - 1999
15
An assessment of ILP-assisted models for toxicology and the ..
- Srinivasan, King et al. - 1999
14
Beyond independence: Probabilistic models for query approxim..
- Pavlov, Mannila et al. - 2003
12
Lattice-search runtime distributions may be heavy-tailed
- Zelezny, Srinivasan et al. - 2003
10
Query transformations for improving the e#ciency of ILP syst.. (context) - Costa, Srinivasan et al. - 2002
7
ciency of inductive logic programming through the use of que.. (context) - Blockeel, Dehaspe et al. - 2001
5
cient subsumption algorithm for inductive logic programming (context) - Kietz, Lubbe - 1994
5
Compact representation of knowledge bases in ILP
- Struyf, Ramon et al.
5
Declarative bias in ILP
- Nedellec, Ade et al. - 1996
3
Implementation techniques for prolog
- Krall - 1994
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2003-E.shtml): More
Uniform Semantic Treatment of Default and Autoepistemic Logics - Denecker (2000)
(Correct)
Advanced Copy Propagation for Arrays - Vanbroekhoven, Janssens.. (2003)
(Correct)
Proving Termination With Adornments - Serebrenik, De Schreye
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC