Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
19
More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets
, 2011
"... 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. The dominant strategies to improve the performance of answering queries arereusinganswerstosubqueriesfortop-downmethods,and transforming rules ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
implementation of Datalog queries using subsumptive tabling, a top-down evaluation method with more reuse of answers than the dominant tabling strategy, and shows that subsumptive tabling beats bottom-up evaluation of rules after magic sets transformation in both time and space complexities. It also describes
Reducing SHIQ − Description Logic to Disjunctive Datalog Programs
, 2004
"... As applications of description logics proliferate, efficient reasoning with large ABoxes (sets of individuals with descriptions) becomes ever more important. Motivated by the prospects of reusing optimization techniques from deductive databases, in this paper, we present a novel approach to checking ..."
Abstract
-
Cited by 143 (20 self)
- Add to MetaCart
resolution-based decision procedure, and (iii) the saturated set of clauses is translated into a disjunctive datalog program. Thus, query answering can be performed using the resulting program, while applying all existing optimization techniques, such as join-order optimizations or magic sets. Equally
Precise Complexity Analysis for Efficient Datalog Queries
, 2010
"... 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 answering the query, topdown evaluation is extended with tabling that stores the results of the subqueries encountered, and bo ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
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 answering the query, topdown evaluation is extended with tabling that stores the results of the subqueries encountered
A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs
- 4th Fuji International Symposium on Functional and Logic Programming, number 1722 in Lecture Notes in Computer Science
, 1999
"... Tabled resolution methods increase the declarativeness and efficiency of logic programs through the sharing of answer computations. In variant-based tabled logic programming systems, answer computations are shared only between calls that are identical modulo variable renaming. Subsumption-based tabl ..."
Abstract
-
Cited by 11 (3 self)
- Add to MetaCart
-based tabling can yield superior performance by sharing answer computations between a more general (subsuming) call and specific (subsumed) calls. But realizing this potential in practice requires the capability to efficiently index into dynamic sets of terms. In an earlier work, we proposed a data structure
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
"... Abstract. As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a SHIQ knowledge base to a disjunctive datalog program while preserving ..."
Abstract
-
Cited by 43 (2 self)
- Add to MetaCart
Abstract. As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a novel reasoning algorithm that reduces a SHIQ knowledge base to a disjunctive datalog program while preserving
Magic Sets and their Application to Data Integration
- In Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2005
, 2005
"... Abstract. We propose a generalization of the well-known Magic Sets technique to Datalog ¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving ..."
Abstract
-
Cited by 33 (9 self)
- Add to MetaCart
Abstract. We propose a generalization of the well-known Magic Sets technique to Datalog ¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving
Description Logics and Disjunctive Datalog—More Than just a Fleeting Resemblance
- In Proc. of the 4th Workshop on Methods for Modalities (M4M4
, 2005
"... As applications of description logics (DLs) proliferate, efficient reasoning with large ABoxes (sets of individuals with descriptions) becomes ever more important. Motivated by the prospects of reusing optimization techniques of deductive databases, we developed a novel algorithm for reasoning in de ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
in description logic, which reduces a DL knowledge base to a disjunctive datalog program without changing the set of relevant consequences. This allows to answer queries by applying optimization techniques, such as join-order optimizations or magic sets. The algorithm supports the very expressive logic SHIQ
The Consistency Extractor System: Answer Set Programs for Consistent Query Answering in Databases
, 2010
"... We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with respect to certain integrity constraints. In order to solve this task, ConsEx uses answers set programming. More precise ..."
Abstract
-
Cited by 17 (9 self)
- Add to MetaCart
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with respect to certain integrity constraints. In order to solve this task, ConsEx uses answers set programming. More
Preference Queries in Deductive Databases 1 Preference Queries in Deductive Databases
"... In many applications, it may be natural to express not only mandatory requirements but also preferences on the data to be retrieved. Lacroix and Lavency 10) extended SQL with a notion of preference and showed how the resulting query language could still be translated into the domain relational calcu ..."
Abstract
- Add to MetaCart
of the magic templates method for datalog 14) that constructs an equivalent but more efficient program for bottom-up evaluation. x1 Motivation and Approach The motivation for our work stems from the observation that traditional database query languages allow the user to express only the mandatory requirements
Results 1 - 10
of
19
