QUERY ROUTING IN A PEER‐TO‐PEER SEMANTIC LINK NETWORK
QUERY ROUTING IN A PEER‐TO‐PEER SEMANTIC LINK NETWORK
复制标题
DOI:
10.1111/j.0824-7935.2005.00271.x
复制
发表时间:
2005-05
影响因子:
2.8
通讯作者:
H. Zhuge;Jie Liu;Liang Feng;Xiaoping Sun;Chao He
中科院分区:
文献类型:
--
作者:
H. Zhuge;Jie Liu;Liang Feng;Xiaoping Sun;Chao He
A semantic link peer‐to‐peer (P2P) network specifies and manages semantic relationships between peers' data schemas and can be used as the semantic layer of a scalable Knowledge Grid. The proposed approach consists of an automatic semantic link discovery method, a tool for building and maintaining P2P semantic link networks (P2PSLNs), a semantic‐based peer similarity measurement for efficient query routing, and the schema mapping algorithms for query reformulation and heterogeneous data integration. The proposed approach has three important aspects. First, it uses semantic links to enrich the relationships between peers' data schemas. Second, it considers not only nodes but also the XML structure in measuring the similarity between schemas to efficiently and accurately forward queries to relevant peers. Third, it copes with semantic and structural heterogeneity and data inconsistency so that peers can exchange and translate heterogeneous information within a uniform view.