A logic programming view of CLP
ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
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
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th 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
Rewriting Unions of General Conjunctive Queries Using Views
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Query rewriting using views in the presence of inclusion dependencies
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Graph-based query rewriting for knowledge sharing between peer ontologies
Information Sciences: an International Journal
Some modifications of bucket-based algorithms for query rewriting using views
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Hi-index | 0.00 |
The problem of rewriting queries using views has important applications in data integration, query optimization, and physical data independence maintenance. Previous researchers have proposed rewriting algorithms for queries and views that are Datalog programs or conjunctive queries with arithmetic comparisons such as x and y ≥ 10. We present a method for finding rewritings of general conjunctive queries, i.e, conjunctive queries with arbitrary built-in predicates, using views. Our method also has advantages over previous algorithms when there are no built-in predicates or when the built-in predicates are conjunctions of arithmetic comparisons. In particular, our method finds strictly more rewritings than the MiniCon [PL00] and the Shared-Variable-Bucket [Mit01] algorithms and tends to be more efficient when the built-in predicates of the query involve only distinguished variables. It finds all rewritings that can be found by the Bucket [LRO96] algorithm in most practical cases, and more efficiently. It finds maximum rewritings in several special cases.