Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The Migration of Multi-tier E-commerce Applications to an Enterprise Java Environment
Information Systems Frontiers
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Optimization of Run-time Management of Data Intensive Web-sites
VLDB '99 Proceedings of the 25th 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
Reengineering of Database Applications to EJB Based Architecture
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query evaluation using overlapping views: completeness and efficiency
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
Query rewriting using views is a technique for answering a query that exploits a set of views instead of accessing the database relations directly. There are two categories of rewritings, i.e., equivalent rewritings using materialized views applied in query optimization, and maximally contained rewritings used mainly in data integration. Although maximally contained rewritings are acceptable in data integration, there are cases where an equivalent rewriting is desired. More importantly, the maximally contained rewriting is a union of contained queries, many of which are redundant. This paper gives an efficient algorithm to find a complete and equivalent rewriting that is a single conjunctive query. We prove that the algorithm is guaranteed to find all the complete and equivalent rewritings, and that the resulting rewriting is guaranteed to be an equivalent one without additional containment checking. We also show that our algorithm is much faster than others through complexity analysis and experimentation.