摘要
在基于自适应技术的基础上,提出了一个Web服务查询优化模型(web service profiler-reoptimizer-cache,WSPRC)。在其核心组件之一的Reoptimizer上采用自适应贪婪算法,分析了其执行Web服务查询优化的过程,并从Web服务有前向约束、无前向约束和信息变化等方面与传统的贪婪算法进行了对比。实验结果表明,WSPRC模型和A-Greedy算法提高了Web服务查询访问的效率,节省了查询成本。
Based on adaptive technology, a query optimization model for web services （web service profiler-reoptimizer-cache, WSPRC） is proposed. One of its core components reoptimizer adopts the adaptive greedy algorithm, and analyzes the implemen tation of web service query optimization process. From several aspects such as with or without precedence constraints and infor- mation changing, the traditional greedy algorithm with A-Greed is compared. Experimental results show that the WSPRC model and A-Greedy algorithm improve efficiency to inquire Web service and save inquiry cost.
出处
《计算机工程与设计》
CSCD
北大核心
2012年第4期1403-1408,共6页
Computer Engineering and Design
