Sciweavers

167 search results - page 1 / 34
» Optimization of Query Plans in the presence of Access Limita...
Sort
View
ICDT
2007
ACM
105views Database» more  ICDT 2007»
14 years 1 months ago
Optimization of Query Plans in the presence of Access Limitations
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 ...
Andrea Calì, Diego Calvanese, Davide Martin...
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 9 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 7 months ago
Computing complete answers to queries in the presence of limited access patterns
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...
Chen Li
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 7 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