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

Proceedings - International Conference on Data Engineering

Volumn 20, Issue , 2004, Pages 840-

  Ludäscher, Bertram ^a   Nash, Alan ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; RUNTIME ALGORITHMS; RUNTIME PROCESSING; WEB SERVICE COMPOSITION;

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; SYNTACTICS; THEOREM PROVING; WORLD WIDE WEB;

QUERY LANGUAGES;

EID: 84862359553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. C. Li. Computing complete answers to queries in the presence of limited access patterns. Journal of VLDB, 12:211-227, 2003.
2. A. Nash and B. Ludäscher. Processing first-order queries with limited access patterns, submitted for publication, 2004.
3. A. Nash and B. Ludäscher. Processing unions of conjunctive queries with negation under limited access patterns. In Intl. Conf. on Extending Database Technology (EDBT), 2004.
4. Web services description language (WSDL) Version 1.2. http://www.w3.org/TR/wsd112, June 2003.