Efficient querying of large process model repositories


Autoria(s): Jin, Tao; Wang, Jianmin; La Rosa, Marcello; ter Hofstedee, Arthur; Wenb, Lijie
Data(s)

22/10/2012

Resumo

Recent years have seen an increased uptake of business process management technology in industries. This has resulted in organizations trying to manage large collections of business process models. One of the challenges facing these organizations concerns the retrieval of models from large business process model repositories. For example, in some cases new process models may be derived from existing models, thus finding these models and adapting them may be more effective and less error-prone than developing them from scratch. Since process model repositories may be large, query evaluation may be time consuming. Hence, we investigate the use of indexes to speed up this evaluation process. To make our approach more applicable, we consider the semantic similarity between labels. Experiments are conducted to demonstrate that our approach is efficient.

Identificador

http://eprints.qut.edu.au/58996/

Publicador

Elsevier BV

Relação

DOI:10.1016/j.compind.2012.09.008

Jin, Tao, Wang, Jianmin, La Rosa, Marcello, ter Hofstedee, Arthur, & Wenb, Lijie (2012) Efficient querying of large process model repositories. Computers in Industry, 64(1), pp. 41-49.

Direitos

Coyright 2012 Elsevier B.V. All rights reserved.

Fonte

School of Information Systems; Science & Engineering Faculty

Palavras-Chave #080600 INFORMATION SYSTEMS #Business process model #Efficient query #Subgraph isomorphism #Process repository
Tipo

Journal Article