Efficient querying of large process model repositories

被引:39
作者
Jin, Tao [1 ,2 ]
Wang, Jianmin [2 ,3 ,4 ]
La Rosa, Marcello
ter Hofstede, Arthur [5 ,6 ]
Wen, Lijie [2 ,3 ,4 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
[3] Minist Educ, Key Lab Informat Syst Secur, Beijing, Peoples R China
[4] Tsinghua Natl Lab Informat Sci & Technol, Beijing, Peoples R China
[5] Queensland Univ Technol, Fac Sci & Engn, Sch Informat Syst, Brisbane, Qld 4001, Australia
[6] Eindhoven Univ Technol, Informat Syst Grp, NL-5600 MB Eindhoven, Netherlands
关键词
Business process model; Efficient query; Subgraph isomorphism; Process repository; BUSINESS PROCESS MODELS; FRAMEWORK; RETRIEVAL; YAWL;
D O I
10.1016/j.compind.2012.09.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:41 / 49
页数:9
相关论文
共 43 条
[1]  
AHO AV, 1976, J ACM, V23, P1, DOI 10.1145/321921.321922
[2]  
[Anonymous], 2007, P EMISA 2007
[3]  
[Anonymous], 2007, Proceedings of the 2007 ACM SIGMOD international conference on Management of data
[4]  
[Anonymous], BUS PROC MAN WORKSH
[5]  
[Anonymous], 2006, P 22 INT C DAT ENG, DOI DOI 10.1109/ICDE.2006.37
[6]  
Brogi A, 2006, LECT NOTES COMPUT SC, V4184, P107
[7]  
Ciaccia P, 1997, PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES, P426
[8]   Thirty years of graph matching in pattern recognition [J].
Conte, D ;
Foggia, P ;
Sansone, C ;
Vento, M .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) :265-298
[9]  
Decker G, 2008, LECT NOTES COMPUT SC, V5240, P386, DOI 10.1007/978-3-540-85758-7_30
[10]   MEASURES OF THE AMOUNT OF ECOLOGIC ASSOCIATION BETWEEN SPECIES [J].
DICE, LR .
ECOLOGY, 1945, 26 (03) :297-302