121 search results - page 5 / 25 » On Containment of Conjunctive Queries with Negation |
PODS
2010
ACM
14 years 23 days ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
PVLDB
2010
13 years 6 months ago
2010
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...
DBPL
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
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...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...