Efficient transitive closure computation in large digraphs
Acta Polytechnica Scandinavica: Mathematics and Computing in Engineering
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Querying business processes with BP-QL
VLDB '05 Proceedings of the 31st international conference on Very large data bases
VisTrails: visualization meets data management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Structural Matching of BPEL Processes
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
Semantic Querying of Business Process Models
EDOC '08 Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference
Efficient Compliance Checking Using BPMN-Q and Temporal Logic
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Oryx --- Sharing Conceptual Models on the Web
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A framework for querying graph-based business process models
Proceedings of the 19th international conference on World wide web
Querying graph-based repositories of business process models
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
On graph query optimization in large networks
Proceedings of the VLDB Endowment
Visually specifying compliance rules and explaining their violations for business processes
Journal of Visual Languages and Computing
Fast business process similarity search with feature-based similarity estimation
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Efficient and accurate retrieval of business process models through indexing
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
iGraph in action: performance analysis of disk-based graph indexing techniques
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Design by selection: a reuse-based approach for business process modeling
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Querying business process models with VMQL
Proceedings of the 5th ACM SIGCHI Annual International Workshop on Behaviour Modelling - Foundations and Applications
| Hi-index | 0.00 |
Business processes are central to the operation of both public and private organizations. With the rapid growth 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 before developing new ones. Therefore, providing support for querying these business process repositories is a crucial requirement. BPMN-Q is a visual language that has been designed to query repositories of business process models. In this paper, we present a novel approach for efficient evaluation of BPMN-Q queries. The approach is based on indexing process models by the transitive closure of their control flow relation as well as path indexes. The closure index is precomputed while the path index is incrementally built through processing of queries. These indexes are utilized to achieve an effective filtering process and an efficient verification check for BPMN-Q queries. The results of our experimental evaluation show the effectiveness of our proposed approach.