ACM Transactions on Database Systems (TODS)
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimizing queries using materialized views: a practical, scalable solution
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Enabling dynamic content caching for database-driven web sites
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Middle-tier database caching for e-business
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Caching Strategies for Data-Intensive Web Sites
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Proceedings of the 27th International Conference on Very Large Data Bases
Extending the Re-use of Query Results at Remote Client Sites
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
A predicate-based caching scheme for client-server database architectures
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
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Rewriting queries using views with access patterns under integrity constraints
Theoretical Computer Science
Information re-retrieval: repeat queries in Yahoo's logs
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Form-based proxy caching for database-backed web sites: keywords and functions
The VLDB Journal — The International Journal on Very Large Data Bases
Query Planning for Searching Inter-dependent Deep-Web Databases
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Scalable multi-query optimization for exploratory queries over federated scientific databases
Proceedings of the VLDB Endowment
Optimization of multi-domain queries on the web
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Nowadays, data dissemination often involves online databases that are hidden behind query forms, thus forming the deep web. Lately, there has been a lot of research interest on supporting query answering over the deep web. To answer a deep web query efficiently, the current approaches generate a query plan for each query independently. However, in practice, deep web queries issued by a user over a short period of time can often share similarities. This, if properly utilized, can help us in generating more efficient query plan. In this paper, we have developed a solution for generating query plan for a deep web query based on the similarities between a given query and a set of earlier queries. Our algorithm systematically finds the reusable components of earlier query plans, and then develops a new query plan reusing these. While the resulting query plans may not be optimal, they are likely to enable more data reuse, and hence, speedup the execution.