期刊文献+

A Novel Multilevel Index Model for Distributed Service Repositories

A Novel Multilevel Index Model for Distributed Service Repositories
原文传递
导出
摘要 This study, based on the theory of equivalence relations, proposes a novel multilevel index model for decentralized service repositories to eliminate redundant information and enhance the time-management quality of the service retrieval process of the service repository architecture. An efficient resource discovery algorithm based on Discrete Hash Tables is presented to enable efficient and effective retrieval services among different distributed repositories. The performance of the proposed model and the supporting algorithms have been evaluated in a distributed environment. Experimental results validate the effectiveness of our proposed indexing model and search algorithm. This study, based on the theory of equivalence relations, proposes a novel multilevel index model for decentralized service repositories to eliminate redundant information and enhance the time-management quality of the service retrieval process of the service repository architecture. An efficient resource discovery algorithm based on Discrete Hash Tables is presented to enable efficient and effective retrieval services among different distributed repositories. The performance of the proposed model and the supporting algorithms have been evaluated in a distributed environment. Experimental results validate the effectiveness of our proposed indexing model and search algorithm.
出处 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2017年第3期273-281,共9页 清华大学学报(自然科学版(英文版)
基金 supported by the National Natural Science Foundation of China(Nos.61502209 and 61502207) Postdoc Funds of China and Jiangsu Province(Nos.2015M580396 and 1501023A) the Jiangsu University Foundation(No.5503000049)
关键词 service computing distributed algorithm service retrieval service storage service computing distributed algorithm service retrieval service storage
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部