Web service composition through declarative queries: The case of conjunctive queries with union and negation

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish (US)
Pages840
Number of pages1
StatePublished - 2004
Externally publishedYes
EventProceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States
Duration: Mar 30 2004Apr 2 2004

Other

OtherProceedings - 20th International Conference on Data Engineering - ICDE 2004
CountryUnited States
CityBoston, MA.
Period3/30/044/2/04

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Fingerprint Dive into the research topics of 'Web service composition through declarative queries: The case of conjunctive queries with union and negation'. Together they form a unique fingerprint.

Cite this