基于不等概率的多级索引模型及其键值选择策略研究  

Research on Multilevel Index Model and Key Selection Strategy Based on Unequal Probability

作　　者：匡雯 顾佳燕 KUANG Wen;GU Jia-yan(Department of Computer Science and Telecommunication Engineering,Jiangsu University,Zhenjiang 212013,China;Department of Electronics,Computing and Mathematics,University of Derby,Derby DE23 3AW United Kingdom)

机构地区：[1]江苏大学计算机科学与通信工程学院,江苏镇江212013 [2]英国德比大学电子计算机数学学院

出　　处：《软件导刊》2019年第1期40-44,共5页Software Guide

基　　金：国家自然科学基金项目(61502209;61502207)

摘　　要：大规模服务存储结构模型研究中,多级索引模型被证明是非常高效的存储结构,具有稳定、易管理、易维护、低冗余的优势。目前的研究建立在服务调用概率平均分布这一假设之上,然而现实服务调用是不等概率的,这意味着多级索引模型在服务调用的不等概率情况下还不是最优。为提高服务调用不等概率条件下多级索引模型的检索效率,通过分析多级索引模型的检索特性,推导出检索操作的时间复杂度函数。利用函数极值,设计了不等概率条件下键值的优化选择方法。实验结果显示,该方法比随机选键方法提高检索效率15%左右,证明优化选择方法能有效提高服务检索效率。Many works studied storage structures of services.Among them,a multilevel index model was proved to be very efficient for service storage for large-scale service repositories.It has the advantages of non-redundancy,stability,being easy managed and maintained.Previous works are proposed and evaluated on the assumption that the probability of service invoking is equal.However,it is too strict in reality,which means the efficiency of service retrieval is not optimal.In order to improve the efficiency of service retrieval under the condition of unequal probability of service invoking,the time complexity of the service retrieval is deduced and an optimal key selection method is proposed according to the function.Our experimental results show that the optimal key selection method reduces 15%of retrieval time.Therefore,the effectiveness and efficiency of the proposed optimal key selection method under unequal probability of service invoking are valid.

关 键 词：服务计算 服务检索 服务存储 多级索引模型 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]