Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Theory of answering queries using views
ACM SIGMOD Record
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the complexity of single-rule datalog queries
Information and Computation - Special issue: ICC '99
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
Theoretical Computer Science - Implementation and application of automata
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tools for composite web services: a short overview
ACM SIGMOD Record
Decidable containment of recursive queries
Theoretical Computer Science - Database theory
Automated Synthesis of Composite BPEL4WS Web Services
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
Specification and verification of data-driven Web applications
Journal of Computer and System Sciences
A lower bound on web services composition
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Semantic Weaving for Context-Aware Web Service Composition
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Specification and verification of multi-user data-driven web applications
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Applying multi-objective evolutionary algorithms to QoS-aware web service composition
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
Behavioural description based web service composition using abstraction and refinement
International Journal of Web and Grid Services
On the aggregation problem for synthesized Web services
Journal of Computer and System Sciences
Model-Driven Approaches to Service Composition
International Journal of Adaptive, Resilient and Autonomic Systems
Hi-index | 0.00 |
The paper investigates fundamental decision problems and composition synthesis for Web services commonly found in practice. We propose a notion of synthesized Web services (ASTs) to specify the behaviors of the services. Upon receiving a sequence of input messages, an AST issues multiple queries to a database and generates actions, in parallel; it produces external messages and database updates by synthesizing the actions parallelly generated. In contrast to previous models for Web services, ASTs advocate parallel processing and (deterministic) synthesis of actions. We classify ASTs based on what queries an AST can issue, how the synthesis of actions is expressed, and whether unbounded input sequences are allowed in a single interaction session. We show that the behaviors of Web services supported by various prior models, data-driven or not, can be specified by different AST classes. For each of these classes we study the non-emptiness, validation and equivalence problems, and establish matching upper and lower bounds on these problems. We also provide complexity bounds on composition synthesis for these AST classes, identifying decidable cases.