Sciweavers

19 search results - page 1 / 4
» An optimization of disjunctive queries: union-pushdown
Sort
View
KRDB
2003
142views Database» more  KRDB 2003»
13 years 8 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
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 7 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
COMPSAC
1997
IEEE
13 years 11 months ago
An optimization of disjunctive queries: union-pushdown
Jae-young Chang, Sang-goo Lee
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
14 years 8 months ago
Unnesting Scalar SQL Queries in the Presence of Disjunction
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
Matthias Brantner, Norman May, Guido Moerkotte
ICLP
2010
Springer
13 years 11 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
Mario Alviano