Sciweavers

113 search results - page 5 / 23
» The containment problem for REAL conjunctive queries with in...
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 8 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
DEDUCTIVE
1994
119views Database» more  DEDUCTIVE 1994»
13 years 10 months ago
Determining Correct View Update Translations via Query Containment
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
Anthony Tomasic
ALT
2000
Springer
14 years 27 days ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
PODS
1998
ACM
116views Database» more  PODS 1998»
14 years 24 days ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
DLOG
2006
13 years 10 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter