期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Semantic Query Mechanism on Peer to Peer XML-Based Information Systems
1
作者 JIANG Min HUANG Yi +1 位作者 GU Jinguang HE Guiming 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第3期525-528,共4页
To enable accessing web information at semantic level, this paper develops a semantic query rewriting mechanism on peer to peer XISs with complex ontology mapping technology. It discusses the patterns of complex ontol... To enable accessing web information at semantic level, this paper develops a semantic query rewriting mechanism on peer to peer XISs with complex ontology mapping technology. It discusses the patterns of complex ontology mappings at first, and the ontology-based query mechanism in peer to peer environment. The extension of XML query algebra and XML query rewriting mechanism are dissussed in detail. 展开更多
关键词 ONTOLOGY query rewriting P2P XML-based information systems
下载PDF
An Efficient Query Rewriting Approach for Web Cached Data Management
2
作者 WANG Bin YANG Xiao-chun WANG Guo-ren YU Ge Liu Hui-lin 《Wuhan University Journal of Natural Sciences》 EI CAS 2006年第1期122-126,共5页
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 cach... 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. 展开更多
关键词 hierarchical query tree DATALOG query rewriting
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部