%0 Journal Article
%T Algorithm of Web Services query based on bottleneck cost<br>一种基于瓶颈开销的Web服务查询算法
%A XU Shu-hua
%A JIANG Wen
%A HUANG Zhi-gang
%A <br>徐署华
%A 江文
%A 黄志刚
%J 计算机应用
%D 2007
%I 
%X Web Service has become a standard method of sharing data and functionality among loosely-coupled systems. An algorithm based on bottleneck cost metric to arrange a query's Web service calls in optimal fashion was proposed. Optimal exploits parallelism among Web services was used to minimize the query's total running time. The optimal plan can be used in the presence of arbitrary precedence constraints among Web services. Compared with other optimal decisions, the experimental results prove the validity of the algorithm.
%K Web Services
%K query optimization
%K algorithm
%K bottleneck cost<br>Web
%K Services
%K 查询优化
%K 算法
%K 瓶颈开销
%K 瓶颈
%K 服务调用
%K 查询算法
%K cost
%K bottleneck
%K based
%K query
%K Web
%K Services
%K 有效性
%K 比较
%K 优化方案
%K 实验
%K 情况
%K 优先约束
%K 存在
%K 运行时间
%K 过程
%K 工作
%K 最佳
%K 度量方式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD27430512A73ADED80DE879A6&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=5D311CA918CA9A03&sid=5370399DC954B911&eid=9806D0D4EAA9BED3&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=6