Sciweavers

145 search results - page 1 / 29
» A Dynamic Approach to Deductive Query Evaluation
Sort
View
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
KRDB
2003
142views Database» more  KRDB 2003»
13 years 6 months ago
Optimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator µ that transforms...
Boris Motik, Raphael Volz
PARLE
1993
13 years 9 months ago
Arithmetic for Parallel Linear Recursive Query Evaluation in Deductive Databases
: An arithmetic approach, such as the Level-Finding method described in this paper for evaluating linear recursive queries in deductive database systems provides great potential fo...
Jerome Robinson, Shutian Lin
PODS
2003
ACM
114views Database» more  PODS 2003»
14 years 5 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
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