84 search results - page 9 / 17 » Decidable Containment of Recursive Queries |
104
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
ICDT
2005
ACM
15 years 5 months ago
2005
ACM
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
170
click to vote
VLDB
2006
ACM
15 years 12 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
LPAR
2005
Springer
15 years 5 months ago
2005
Springer
Integrity checking is an essential means for the preservation of the intended semantics of a deductive database. Incrementality is the only feasible approach to checking and can be...