Sciweavers

Share
59 search results - page 1 / 12
» Rewriting Unions of General Conjunctive Queries Using Views
Sort
View
EDBT
2002
ACM
136views Database» more  EDBT 2002»
10 years 6 days ago
Rewriting Unions of General Conjunctive Queries Using Views
The problem of finding contained rewritings of queries using views is of great importance in mediated data integration systems. In this paper, we first present a general approach f...
Junhu Wang, Michael J. Maher, Rodney W. Topor
WWW
2011
ACM
8 years 7 months ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
10 years 7 days ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
WIDM
2003
ACM
9 years 5 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
ICDT
2009
ACM
119views Database» more  ICDT 2009»
10 years 24 days ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
books