Skip to main content

TS

On efficient processing of BPMN-q queries

Authors

Ahmed Awad and Sherif Sakr

Cairo University

NICTA

UNSW

Abstract

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 di erent 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 ecient evaluation of BPMN-Q queries. The approach is based on indexing process models by the transitive closure of their control ow 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 e ffective fi ltering process and an ecient veri cation check for BPMN-Q queries. The results of our experimental evaluation show the e ectiveness of our proposed approach.

BibTeX Entry

  @article{Awad_Sakr_12,
    journal          = {Journal of Computers in Industry, Elsevier},
    author           = {Awad, Ahmed and Sakr, Sherif},
    number           = {9},
    month            = aug,
    volume           = {63},
    year             = {2012},
    keywords         = {business process repository, bpmn-q, querying, indexing},
    title            = {On Efficient Processing of {BPMN}-Q Queries},
    pages            = {867-881}
  }

Download

Served by Apache on Linux on seL4.