Sciweavers

126 search results - page 9 / 26
» The Complexity of Acyclic Conjunctive Queries
Sort
View
IPL
2006
99views more  IPL 2006»
13 years 7 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
PODS
2011
ACM
220views Database» more  PODS 2011»
12 years 10 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 months ago
The Complexity of Causality and Responsibility for Query Answers and non-Answers
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
Alexandra Meliou, Wolfgang Gatterbauer, Katherine ...
SEBD
2007
121views Database» more  SEBD 2007»
13 years 9 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 7 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch