Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation
ICDE(2004)
摘要
A Web service operation can be seen as a function op: X1,..., Xn → Y1,..., Ym having an input message (request) with n arguments (parts), and an output message (response) with m parts. We study the problem of deciding whether a query Q is feasible, i.e., whether there exists a logically equivalent query Q' that can be executed observing the limited access patterns given by the Web service (source) relations. Executability depends on the specific syntactic form of a query, while feasibility is a more "robust" semantic notion, involving all equivalent queries (i.e., reorderings, minimized queries, etc). We show that deciding query feasibility (called "stability") is NP-complete for conjunctive queries (CQ) and for conjunctive queries with union (UCQ).
更多查看译文
关键词
declarative queries,web service composition,conjunctive queries,internet,relational databases,computational complexity,web service
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要