An Efficient Query Rewriting Approach for Web Cached Data Management

作     者：WANG Bin YANG Xiao-chun WANG Guo-ren YU Ge Liu Hui-lin 

作者机构：School of Information Science and EngineeringNortheastern University Shenyang 110004 Liaoning China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2006年第11卷第1期

页      面：122-126页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

基　　金：Supported by the National Natural Science Funda-tion of China (60473074) and Natural Science Foundationfor DoctoralCareer Award of Liaoning Province (20041016) 

主　　题：hierarchical query tree datalog query rewriting 

摘      要：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.