84 search results - page 6 / 17 » Decidable Containment of Recursive Queries |
PODS
2004
ACM
14 years 11 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
JAR
2006
13 years 11 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ICDE
2009
IEEE
15 years 18 days ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
EDBT
2004
ACM
14 years 11 months ago
2004
ACM
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...
ICDT
2010
ACM
14 years 27 days ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...