摘要
假设同一虚拟组织的成员经常拥有同样的专业兴趣,设计了一种新的数据结构——节点服务表(Node-Service-Table,NST)来记录每个成员的服务搜索经验,借助NST改进了基于经验共享的服务搜索方法CSE。改进算法不仅能减少搜索的盲目性,提高命中率,而且可以用于估算网格工作流执行时间。该方法的时间复杂性是O(n),空间复杂性是O(n2)。
On the hypothesis that members in one Virtual Organization （VO） often have the same interests, it designs a new kind of data structure--Node-Service-Table （NST） to record experience of service locating for each VO member. In terms of NST, an extended Experience-based Classifying Search （CSE） algorithm with shared experience is raised. It can not only reduce the searching blindness and improve success rate of search, but also can be used to estimate the execution time of a Grid workflow. Its time complexity is O（n） and space complexity is O（n^2 ）.
出处
《计算机科学与探索》
CSCD
2008年第5期511-518,共8页
Journal of Frontiers of Computer Science and Technology
基金
the National Natural Science Foundation of China under Grant No.60673112~~
关键词
网格中间件
服务搜索
元数据
节点服务表
Grid middleware
service locating
metadata
Node-Service-Table （NST）
