Abstract
Web service composition through declarative queries was described. Executability depends on the specific syntactic form of query while feasibility is a more robust semantic notion involving all equivalent queries. An algorithm was also presented to compute complete answers to queries that are not feasible. It was emphasized that the costly containment check should be avoided by using two efficiently computable approximate execution plans.
| Original language | English (US) |
|---|---|
| Pages | 840 |
| Number of pages | 1 |
| State | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States Duration: Mar 30 2004 → Apr 2 2004 |
Other
| Other | Proceedings - 20th International Conference on Data Engineering - ICDE 2004 |
|---|---|
| Country/Territory | United States |
| City | Boston, MA. |
| Period | 3/30/04 → 4/2/04 |
ASJC Scopus subject areas
- Software
- Signal Processing
- Information Systems