Sciweavers

PPDP
2010
Springer
13 years 2 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
ADBIS
1995
Springer
130views Database» more  ADBIS 1995»
13 years 8 months ago
Magic Sets vs. SLD-Resolution
It is by now folklore that the bottom-up evaluation of a program after the “magic set” transformation is “as efficient as” top-down evaluation. There are a number of forma...
Stefan Brass
ICLP
2010
Springer
13 years 8 months ago
Implementation Alternatives for Bottom-Up Evaluation
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
Stefan Brass
VLDB
1990
ACM
86views Database» more  VLDB 1990»
13 years 8 months ago
How to Forget the Past Without Repeating It
Bottom-up evaluation of deductive database programs has the advantage that it avoids repeated computation by storing all intermediate results and replacing recomputation by table ...
Jeffrey F. Naughton, Raghu Ramakrishnan
PPDP
2004
Springer
13 years 10 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato