Sherif Sakr
Ahmed Awad
ABSTRACT
We present a framework for querying and reusing graph-based business process models. The framework is based on a new visual query language for business processes called BPMN-Q. The language addresses processes definitions and extends the standard BPMN visual notations for modeling business processes for its concrete syntax. BPMN-Q is used to query process models by matching a process model graph to a query graph. Moreover, the reusing framework is enhanced with a semantic query expander component. This component provides the users with the flexibility to get not only the perfectly matched process models to their queries but also the models with high similarity. The query engine of the framework is built on top of traditional RDBMS. A novel decomposition based and selectivity-aware relational processing mechanism is employed to achieve an efficient and scalable performance for graph-based BPMN-Q queries.
- A. Awad. BPMN--Q: A language to query business processes. In EMISA, 2007.Google Scholar
- A. Awad, G. Decker, and M. Weske. Efficient Compliance Checking Using BPMN-Q and Temporal Logic. In BPM, 2008. Google ScholarDigital Library
- A. Awad, A. Polyvyanyy, and M. Weske. Semantic querying of business process models. In EDOC, 2008. Google ScholarDigital Library
- A. Awad and F. Puhlmann. Structural Detection of Deadlocks in Business Process Models. In BIS, 2008.Google Scholar
- G. Graefe. Sorting And Indexing With Partitioned B--Trees. In CIDR, 2003.Google Scholar
- T. Grust, M. Mayr, J. Rittinger, S. Sakr, and J. Teubner. A SQL:1999 Code Generator for the Pathfinder XQuery Compiler. In SIGMOD, 2007. Google ScholarDigital Library
- T. Grust, S. Sakr, and J. Teubner. XQuery on SQL Hosts. In VLDB, 2004. Google ScholarDigital Library
- R. Laue and A. Awad. Visualization of business process modeling anti patterns. In VFfP, 2009.Google Scholar
- S. Sakr. GraphREL: A decomposition-based and selectivity-aware relational framework for processing sub-graph queries. In DASFAA, 2009. Google ScholarDigital Library
- G. Salton, A. Wong, and C. S. Yang. A Vector Space Model for Automatic Indexing. Commun. ACM, 18(11), 1975. Google ScholarDigital Library
- J. Teubner, T. Grust, S. Maneth, and S. Sakr. Dependable Cardinality Forecats for XQuery. In VLDB, 2008. Google ScholarDigital Library
- Matthias Weidlich, Gero Decker, Alexander Großkopf, and Mathias Weske. BPEL to BPMN: The myth of a straight-forward mapping. In OTM, 2008. Google ScholarDigital Library
Index Terms
- A framework for querying graph-based business process models
Recommendations
Querying graph-based repositories of business process models
DASFAA'10: Proceedings of the 15th international conference on Database systems for advanced applicationsWith the rapid and incremental increase in the number of process models developed by different process designers, it becomes crucial for business process designers to be able to look up the repository for models that could handle a similar situation ...
Querying business process model repositories
Business process management technology is becoming increasingly popular, resulting in more and more business process models being created. Hence, there is a need for these business process models to be managed effectively. For effective business process ...
Querying business process models based on semantics
DASFAA'11: Proceedings of the 16th international conference on Database systems for advanced applications: Part IIIn recent years, the technology of business process management is being more widely used, so that there are more and more business process models (graphs). How to manage such a large number of business process models is challenging, among which the ...
Comments