Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Rewriting queries using views in description logics
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An algorithm for answering queries efficiently using views
ADC '01 Proceedings of the 12th Australasian database conference
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Tableau Techniques for Querying Information Sources through Global Schemas
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Answering Queries Using Materialized Views with Disjunctions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Optimizing Queries Across Diverse Data Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Optimization of Run-time Management of Data Intensive Web-sites
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Answering Queries Using Views over Description Logics Knowledge Bases
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query planning and optimization in information integration
Query planning and optimization in information integration
Finding equivalent rewritings in the presence of arithmetic comparisons
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Data exchange in the presence of arithmetic comparisons
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Complexity and composition of synthesized web services
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Approximate Rewriting of Queries Using Views
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Computing certain answers in the presence of dependencies
Information Systems
Ranking Approximate Query Rewritings Based on Views
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Determinacy and query rewriting for conjunctive queries and views
Theoretical Computer Science
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
Certain answers for views and queries expressed as non-recursive datalog programs with negation
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Rewriting conjunctive queries determined by views
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 5.23 |
We consider the problem of answering queries using views, where queries and views are conjunctive queries with arithmetic comparisons over dense orders. Previous work only considered limited variants of this problem, without giving a complete solution. We first show that obtaining equivalent rewritings for conjunctive queries with arithmetic comparisons is decidable. Then, we consider the problem of finding maximally contained rewritings (MCRs) where the decidability proof does not carry over. We investigate two special cases of this problem where the query uses only semi-interval comparisons. In both cases decidability of finding MCRs depends on the query containment test. First, we address the case where the homomorphism property holds in testing query containment. In this case decidability is easy to prove but developing an efficient algorithm is not trivial. We develop such an algorithm and prove that it is sound and complete. This algorithm applies in many cases where the query uses only left (or right) semi-interval comparisons. Then, we develop a new query containment test for the case where the containing query uses both left and right semi-interval comparisons but with only one left (or right) semi-interval subgoal. Based on this test, we show how to produce an MCR which is a Datalog query with arithmetic comparisons. The containment test that we develop obtains a result of independent interest. It finds another special case where query containment in the presence of arithmetic comparisons can be tested in nondeterministic polynomial time.