检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,沈阳110004
出 处:《Journal of Southeast University(English Edition)》2007年第3期322-326,共5页东南大学学报(英文版)
基 金:The National Natural Science Foundation of China(No60573089);the Natural Science Foundation of Liaoning Province(No20052031);the National High Technology Research and Develop-ment Program of China (863Program)(No2006AA09Z139)
摘 要:Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network (SSON) is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs.针对使用分类层次来描述数据语义的分布式数据源,提出了一种支持数据共享的基于super-peer的语义覆盖网络SSON.SSON能够根据数据的语义,动态地将peer划分成多个语义簇,语义簇之间组织成语义覆盖网络.每个语义簇由一个super-peer和一组peer组成,仅负责回答其语义子空间上的查询.查询首先根据其语义被路由到适合的语义簇中,然后被转发给包含结果的peer.同时给出了相关的算法,并进行了实验研究,实验结果表明,SSON具有良好的可扩展性,并在查找性能和代价之间取得了一个良好的折中.
关 键 词:peer to peer (P2P) taxonomy hierarchy semantic searching
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33