Paper Info
Title
Querying Data Sources that Export Infinite Sets of Views
Abstract
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 infinite) families of queries. We revisit a classical setting in which the application queries are conjunctive queries and the source accepts families of conjunctive queries specified as the expansions of a (potentially recursive) Datalog program with parameters. We say that query Q is expressible by the program $\ensuremath{\mathcal{P}}$ if it is equivalent to some expansion of $\ensuremath{\mathcal{P}}$. Q is supported by $\ensuremath{\mathcal{P}}$ if it has an equivalent rewriting using some finite set of $\ensuremath{\mathcal{P}}$ ’s expansions. We present the first study of expressibility and support for sources that satisfy integrity constraints, which is generally the case in practice.
Year
DOI
Venue
2011
10.1007/s00224-010-9293-4
Theory of Computing Systems \/ Mathematical Systems Theory
Keywords
DocType
Volume
Query rewriting using views,Limited query capabilities,Integrity constraints,Datalog
Journal
49
Issue
ISSN
Citations 
2
1432-4350
7
PageRank 
References 
Authors
0.47
25
3
Name
Order
Citations
PageRank
Bogdan Cautis124623.35
Alin Deutsch22267247.45
Nicola Onose344424.68