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...
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...
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
We consider the problem of querying data sources that have limited capabilities and can thus only be accessed by complying with certain binding patterns for their attributes. This ...