Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using limited external query processors (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Answering queries using limited external query processors
Journal of Computer and System Sciences
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Testing implications of data dependencies
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Query Translation Scheme for Rapid Implementation of Wrappers
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Proceedings of the Fifth International Conference on Data Engineering
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Describing and Using Query Capabilities of Heterogeneous Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Query Planning with Limited Source Capabilities
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Extending query rewriting techniques for fine-grained access control
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Processing first-order queries under limited access patterns
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query reformulation with constraints
ACM SIGMOD Record
Rewriting queries with arbitrary aggregation functions using views
ACM Transactions on Database Systems (TODS)
Finding equivalent rewritings in the presence of arithmetic comparisons
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Rewriting queries using views with access patterns under integrity constraints
ICDT'05 Proceedings of the 10th international conference on Database Theory
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
Composition with target constraints
Proceedings of the 13th International Conference on Database Theory
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Active knowledge: dynamically enriching RDF knowledge bases by web services
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Querying XML data sources that export very large sets of views
ACM Transactions on Database Systems (TODS)
Rewriting queries on SPARQL views
Proceedings of the 20th international conference on World wide web
| Hi-index | 0.00 |
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. We say that query Q is expressible by the program P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of 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.