Query Optimization Plan of Web Services Based on Greedy Algorithm
Shuhua Xu, Jiang Wen, Zhigang Huang · Jisuanji gongcheng · 2008
This paper proposes a greedy algorithm to arrange all Web service calls of a query into a pipelined execution plan that optimallyexploits parallelism among Web services to minimize the query’s total running time. It solves the basic question: query optimization forselect-project-join queries spanning multiple Web services. The optimization plan can be found in the presence of arbitrary precedence constraintsamong Web services.