Although widely addressed, automatically composing a web service from existing services is still a difficult problem. This paper focuses on the service synthesis problem for relational services. It considers answering complex queries using a set of available relational services collectively with a two step solution. The method guarantees to find a solution if there is one, and its time complexity is polynomial.
展开▼
