An Efficient Query Rewriting Approach for Web Cached Data Management

0 IntroductionWitmhentth ef oerxp slhosairvineg gr ionwfotrhm oaft itohne iWsW aW k,eythe p rroeqblueirme-.When we deal withthe unprecedented amount of data,we areeasylost in browsing them. Thus , handling these data effi-ciently becomes more difficult than before.Consider the application domain publication retrieval ,which are abundant onthe Web and usually demandlongti meto generate the end-results through the query interfaces pro-vided by search engines .It oftenrequires three steps to de…

An efficient query rewriting approach for Web cached data management

With the internet development, querying data on the Web is an attention problem of involving information from distributed, and often dynamically, related Web sources. Basically, some subqueries can be effectively cached from previous queries or materialized views in order to achieve a better query performance based on the notion of rewriting queries. In this paper, we propose a novel query-rewriting model, called Hierarchical Query Tree, for representing Web queries. Hierarchical Query Tree is a labeled tree that is suit able for representing the inherent hierarchy feature of data on the Web. Based on Hierarchical Query Tree, we use case based approach to determine what the query results should be. The definitions of queries and query results are both re presented as labeled trees. Thus, we can use the same model for representing cases and the medium query results can also be dynamically updated by the user queries. We show that our case-based method can be used to answer a new query based on the combination of previous queries, including changes of requirements and various information sources.