Sciweavers

142 search results - page 7 / 29
» On Conjunctive Query Answering in EL
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
ICDT
2012
ACM
235views Database» more  ICDT 2012»
12 years 6 days ago
Equivalence and minimization of conjunctive queries under combined semantics
The problems of query containment, equivalence, and minimization are recognized as very important in the context of query processing, specifically of query optimization. In their...
Rada Chirkova
PAKDD
2004
ACM
94views Data Mining» more  PAKDD 2004»
14 years 3 months ago
Towards Optimizing Conjunctive Inductive Queries
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
Johannes Fischer, Luc De Raedt
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 4 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
SIGMOD
2004
ACM
107views Database» more  SIGMOD 2004»
14 years 10 months ago
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
Ahmed Ayad, Jeffrey F. Naughton