Sciweavers

19 search results - page 1 / 4
» On Preservation under Homomorphisms and Unions of Conjunctiv...
Sort
View
PODS
2004
ACM
139views Database» more  PODS 2004»
14 years 4 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 4 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
ICDT
2009
ACM
173views Database» more  ICDT 2009»
14 years 5 months ago
Containment of conjunctive queries on annotated relations
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
Todd J. Green
FOCS
2003
IEEE
13 years 9 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
AMAI
2007
Springer
13 years 4 months ago
Database querying under changing preferences
We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is query modification: a query tran...
Jan Chomicki