Abstract | ||
---|---|---|
Although the service composition problem has been widely addressed, automatically composing a service from existing services is still very difficult. This paper focuses on the composition problem for relational Web services. It considers answering complex queries using a set of available relational services collectively. The method we present is guaranteed to find a solution if there is one. |
Year | DOI | Venue |
---|---|---|
2009 | 10.1109/ICSC.2009.18 | ICSC |
Keywords | Field | DocType |
composition problem,relational web service,service composition problem,web services,join decomposition,query decomposition,available relational service,relational service composition,query synthesis,ontologies (artificial intelligence),complex query,ontologies,business,impedance matching,algorithm design and analysis,pediatrics,web service,data mining | Ontology (information science),World Wide Web,Algorithm design,Relational database,Computer science,Service composition,Web service | Conference |
ISBN | Citations | PageRank |
978-0-7695-3800-6 | 0 | 0.34 |
References | Authors | |
11 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Qi Wang | 1 | 1 | 0.70 |
Phillip C. -Y. Sheu | 2 | 9 | 3.98 |