Querying Structural and Behavioral Properties of Business Processes

  • Daniel Deutch
  • Tova Milo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4797)

Abstract

BPQL is a novel query language for querying business process specifications, introduced recently in [5,6]. It is based on an intuitive model of business processes as rewriting systems, an abstraction of the emerging BPEL (Business Process Execution Language) standard [7]. BPQL allows users to query business processes visually, in a manner very analogous to the language used to specify the processes. The goal of the present paper is to study the formal model underlying BPQL and investigate its properties as well as the complexity of query evaluation. We also study its relationship to previously suggested formalisms for process modeling and querying. In particular we propose a query evaluation algorithm of polynomial data complexity that can be applied uniformly to queries on the structure of the process specification as well as on the potential behavior of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Abrams, Z., Haar, S., Milo, T.: Diagnosis of asynchronous discrete event systems: datalog to the rescue! In: Proc. of PODS 2005 (2005)Google Scholar
  2. 2.
    Abiteboul, S., Benjelloun, O., Milo, T.: Positive active xml. In: Proc. of PODS 2004 (2004)Google Scholar
  3. 3.
    Abiteboul, S., Fischer, P.C., Schek, H.J.: Nested Relations and Complex Objects in Databases. LNCS, vol. 361. Springer, Heidelberg (1989)MATHGoogle Scholar
  4. 4.
    Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27(4) (2005)Google Scholar
  5. 5.
    Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying Business Processes with BP-QL (demo). In: Proc. of VLDB (2005)Google Scholar
  6. 6.
    Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying business processes. In: Proc. of VLDB (2006)Google Scholar
  7. 7.
    Business Process Execution Language for Web Services. http://www.ibm.com/developerworks/library/ws-bpel/
  8. 8.
    BPMI. Business process management initiative: Business process: Business process query language (bpql). http://www.service-architecture.com/web-services/articles/business_process_query_language_bpql.html
  9. 9.
    Buneman, P., Cong, G., Fan, W., Kementsietsidis, A.: Using partial evaluation in distributed query evaluation. In: Proc. of VLDB (2006)Google Scholar
  10. 10.
    Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, Springer, Heidelberg (1992)CrossRefGoogle Scholar
  11. 11.
    Chamberlin, D.: Xquery: a query language for xml. In: Proc. of SIGMOD (2003)Google Scholar
  12. 12.
    Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)Google Scholar
  13. 13.
    Consens, M., Mendelzon, A.: The g+/graphlog visual query system. In: Proc. of SIGMOD (1990)Google Scholar
  14. 14.
    Courcelle, B.: The monadic second-order logic of graphs. Inf. Comput. 85(1) (1990)Google Scholar
  15. 15.
    Deutsch, A., Sui, L., Vianu, V., Zhou, D.: Verification of communicating data-driven web services. In: Proc. of PODS (2006)Google Scholar
  16. 16.
    Dovier, A., Piazza, C.: The subgraph bisimulation problem. IEEE Trans. Knowl. Eng. 15(4) (2003)Google Scholar
  17. 17.
    Querying structural and behavioral properties of business processes - full version. http://www.cs.tau.ac.il/~danielde/BPQLFull.pdf/
  18. 18.
    Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)Google Scholar
  19. 19.
    Grohe, M.: Parameterized complexity for the database theorist. SIGMOD Rec. 31(4) (2002)Google Scholar
  20. 20.
    Janssens, D., Rozenberg, G.: Graph grammars with node-label controlled rewriting and embedding. In: Proc. of COMPUGRAPH (1983)Google Scholar
  21. 21.
    Lam, M.S., Whaley, J., Livshits, V.B., Martin, M.C., Avots, D., Carbin, M., Unkel, C.: Context-sensitive program analysis as database queries. In: Proc. of PODS (2005)Google Scholar
  22. 22.
    Lengauer, T., Wanke, E.: Efficient decision procedures for graph properties on context-free graph languages. J. ACM 40(2) (1993)Google Scholar
  23. 23.
    Oracle BPEL Process Manager 2.0 Quick Start Tutorial. http://www.oracle.com/technology/products/ias/bpel/index.html
  24. 24.
    Pavlidis, T.: Linear and context-free graph grammars. J. ACM 19(1) (1972)Google Scholar
  25. 25.
    Schurr, A.: Logic based programmed structure rewriting systems. Fundam. Inf. 26(3-4) (1996)Google Scholar
  26. 26.
    The World Wide Web Consortium. http://www.w3.org/

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Daniel Deutch
    • 1
  • Tova Milo
    • 1
  1. 1.School of Computer Science, Tel Aviv University 

Personalised recommendations