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.
The research has been partially supported by the European Project EDOS and the Israel Science Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Abrams, Z., Haar, S., Milo, T.: Diagnosis of asynchronous discrete event systems: datalog to the rescue! In: Proc. of PODS 2005 (2005)
Abiteboul, S., Benjelloun, O., Milo, T.: Positive active xml. In: Proc. of PODS 2004 (2004)
Abiteboul, S., Fischer, P.C., Schek, H.J.: Nested Relations and Complex Objects in Databases. LNCS, vol. 361. Springer, Heidelberg (1989)
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)
Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying Business Processes with BP-QL (demo). In: Proc. of VLDB (2005)
Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying business processes. In: Proc. of VLDB (2006)
Business Process Execution Language for Web Services. http://www.ibm.com/developerworks/library/ws-bpel/
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
Buneman, P., Cong, G., Fan, W., Kementsietsidis, A.: Using partial evaluation in distributed query evaluation. In: Proc. of VLDB (2006)
Burkart, O., Steffen, B.: Model checking for context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, Springer, Heidelberg (1992)
Chamberlin, D.: Xquery: a query language for xml. In: Proc. of SIGMOD (2003)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)
Consens, M., Mendelzon, A.: The g+/graphlog visual query system. In: Proc. of SIGMOD (1990)
Courcelle, B.: The monadic second-order logic of graphs. Inf. Comput. 85(1) (1990)
Deutsch, A., Sui, L., Vianu, V., Zhou, D.: Verification of communicating data-driven web services. In: Proc. of PODS (2006)
Dovier, A., Piazza, C.: The subgraph bisimulation problem. IEEE Trans. Knowl. Eng. 15(4) (2003)
Querying structural and behavioral properties of business processes - full version. http://www.cs.tau.ac.il/~danielde/BPQLFull.pdf/
Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Grohe, M.: Parameterized complexity for the database theorist. SIGMOD Rec. 31(4) (2002)
Janssens, D., Rozenberg, G.: Graph grammars with node-label controlled rewriting and embedding. In: Proc. of COMPUGRAPH (1983)
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)
Lengauer, T., Wanke, E.: Efficient decision procedures for graph properties on context-free graph languages. J. ACM 40(2) (1993)
Oracle BPEL Process Manager 2.0 Quick Start Tutorial. http://www.oracle.com/technology/products/ias/bpel/index.html
Pavlidis, T.: Linear and context-free graph grammars. J. ACM 19(1) (1972)
Schurr, A.: Logic based programmed structure rewriting systems. Fundam. Inf. 26(3-4) (1996)
The World Wide Web Consortium. http://www.w3.org/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deutch, D., Milo, T. (2007). Querying Structural and Behavioral Properties of Business Processes. In: Arenas, M., Schwartzbach, M.I. (eds) Database Programming Languages. DBPL 2007. Lecture Notes in Computer Science, vol 4797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75987-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-75987-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75986-7
Online ISBN: 978-3-540-75987-4
eBook Packages: Computer ScienceComputer Science (R0)