Sciweavers

13 search results - page 1 / 3
» Soft stratification for magic set based query evaluation in ...
Sort
View
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 4 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
WLP
2000
Springer
13 years 8 months ago
A Dynamic Approach to Deductive Query Evaluation
In this paper, a dynamic approach to deductive query evaluation is presented which combines the e ects of di erent SIP strategies used for the magic set rewriting technique. Given...
Andreas Behrend
VLDB
1991
ACM
165views Database» more  VLDB 1991»
13 years 8 months ago
Aggregation and Relevance in Deductive Databases
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and “largest Ic values.” Our approach is based ...
S. Sudarshan, Raghu Ramakrishnan
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
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
13 years 11 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend