检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:严华云[1]
机构地区:[1]湖州师范学院信息工程学院,浙江湖州313000
出 处:《湖州职业技术学院学报》2016年第1期1-5,共5页Journal of Huzhou Vocational and Technological College
基 金:2015年度湖州师范学院出国访学项目的研究成果之一
摘 要:针对Chord结构并未考虑用户查询偏好的问题,提出了一种基于语义网络的分层DHT以解决该问题。在该分层DHT中,节点和关键词按语义关系组织,节点选择自己感兴趣的区域加入,每个区域选一个稳定节点作为超级节点,节点间按语义关系组织,各个区域按2-Chord结构组织。在此基础上提出了相应的路由算法,该算法先检查关键词是否归本地区域管理,否则转发给上层超级节点去处理,如此递归转发查询直至返回查询结果。实验发现,用户的查询关键词较偏好本地区域时,分层DHT较2-Chord的路由效率得到了一定提升,这种效果随着偏好度的增大越发明显。Aiming at Chord structure and considering the preferential problems of user query,a hierarchy DHT based on semantic network is proposed to resolve the issue.In this hierarchical DHT,nodes and keywords are organized according to semantic relations,nodes select the areas that are interesting to join in,a stable node of each area is selected as a super node,the organizations are done between nodes according to semantic relationships,and each area is organized according to 2-Chord structure.On this basis,the corresponding routing algorithm is put forward,first,this algorithm checks if keywords belong to this region management,otherwise forward to the upper super-peer to deal with,do this recursive forwarding check,until returning to query results.It was found that,when a user's query keywords prefer local zone,the routing efficiency of hierarchical DHT has some improvement compared with 2-Chord,this effect becomes increasingly obvious with increasing preference.
分 类 号:G712[文化科学—职业技术教育学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7