skip to main content
10.1145/1376916.1376949acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Complexity and composition of synthesized web services

Authors Info & Claims
Published:09 June 2008Publication History

ABSTRACT

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.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Abiteboul, V. Vianu, B.S. Fordham, and Y. Yesha. Relational transducers for electronic commerce. JCSS, 61(2):236--269, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. F.N. Afrati, M. Gergatsoulis, and T.G. Kavalieros. Answering queries using materialized views with disjunctions. In ICDT, 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. F.N. Afrati, C. Li, and P. Mitra. Rewriting queries using views in the presence of arithmetic comparisons. Theor. Comput. Sci., 368(1-2):88--123, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Berardi, D. Calvanese, G.D. Giacomo, R. Hull, and M. Mecella. Automatic composition of transition-based semantic web services with messaging. In VLDB, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Berardi, D. Calvanese, G.D. Giacomo, M. Lenzerini, and M. Mecella. Automatic service composition based on behavioral descriptions. Int. J. Cooperative Inf. Syst., 14(4):333--376, 2005.]]Google ScholarGoogle ScholarCross RefCross Ref
  7. Business Process Execution Language for Web Services version 1.1 (BEPL4WS), 2004. http://www.ibm.com/developerworks/library/specification/ws-bpel/]]Google ScholarGoogle Scholar
  8. D. Calvanese, G.D. Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. JCSS, 64(3):443--465, 2002.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. Calvanese, G.D. Giacomo, and M.Y. Vardi. Decidable containment of recursive queries. TCS, 336(1):33--56, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Chaudhuri and M.Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. JCSS, 54(1):61--78, 1997.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S.S. Cosmadakis and P.C. Kanellakis. Parallel evaluation of recursive rule queries. In PODS, 1986.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Deutsch, L. Sui, and V. Vianu. Specification and verification of data-driven Web applications. JCSS, 73(3):442--474, 2007.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Deutsch, L. Sui, V. Vianu, and D. Zhou. Verification of communicating data-driven Web services. In PODS, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. O.M. Duschka and M.R. Genesereth. Answering recursive queries using views. In PODS, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. X. Fu, T. Bultan, and J. Su. Analysis of interacting BPEL Web services. In WWW, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. X. Fu, T. Bultan, and J. Su. Conversation protocols: a formalism for specification and verification of reactive electronic services. TCS, 328(1-2):19--37, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Garey and D. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C.E. Gerede, R. Hull, O.H. Ibarra, and J. Su. Automated composition of e-services: lookaheads. In ICSOC, 2004.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. G. Gottlob and C. Papadimitriou. On the complexity of single rule datalog queries. Inf. Comput., 183(1):104--122, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Y. Halevy. Theory of answering queries using views. SIGMOD Record, 29(4), 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. R. Hull and J. Su. Tools for composite web services: a short overview. SIGMOD Record, 34(1):5--12, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. A. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146--160, 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. A. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. A. Muscholl and I. Walukiewicz. A lower bound on Web services composition. In FoSSaCS, 2007.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. OWL-S: Semantic Markup for Web Services, 2004. http://www.w3.org/Submission/OWL-S/.]]Google ScholarGoogle Scholar
  26. M. Pistore, P. Traverso, P. Bertoli, and A. Marconi. Automated synthesis of composite BPEL4WS web services. In ISWC, 2005.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Semantic Web Services Framework (SWSF) Version 1.1, 2005. http://www.daml.org/services/swsf/1.1/.]]Google ScholarGoogle Scholar
  28. M. Spielmann. Abstract State Machines: Verification Problems and Complexity. PhD thesis, RWTH , 2000.]]Google ScholarGoogle Scholar
  29. M. Spielmann. Verification of relational transducers for electronic commerce. JCSS, 66(1):40--65, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Web Services Conversation Language (WSCL) 1.0, 2002. http://www.w3.org/TR/wscl10/.]]Google ScholarGoogle Scholar
  31. Web Services Description Language (WSDL) 1.1, 2001. http://www.w3.org/TR/wsdl.]]Google ScholarGoogle Scholar
  32. S. Yu. Regular languages. In Handbook of Formal Languages, volume 1. Springer, 1996.]]Google ScholarGoogle Scholar

Index Terms

  1. Complexity and composition of synthesized web services

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2008
          330 pages
          ISBN:9781605581521
          DOI:10.1145/1376916

          Copyright © 2008 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 June 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!