Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Decentralized execution of linear workflows over web services
Future Generation Computer Systems
| Hi-index | 0.00 |
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinnings of a newly proposed algorithm that produces the optimal linear ordering corresponding to a query being executed in a decentralized manner, i.e., when the services communicate directly with each other. The optimality is defined in terms of query response time, which is determined by the bottleneck service in the plan. The properties discussed in this work allow a branch-and-bound approach to be very efficient.