Querying business process model repositories

被引:39
作者
Wang, Jianmin [1 ,2 ,3 ]
Jin, Tao [1 ,2 ,3 ]
Wong, Raymond K. [4 ]
Wen, Lijie [1 ,2 ,3 ]
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
[2] Minist Educ, Key Lab Informat Syst Secur, Beijing, Peoples R China
[3] Tsinghua Natl Lab Informat Sci & Technol, Beijing, Peoples R China
[4] Univ New S Wales, Sch Engn & Comp Sci, Kensington, NSW 2033, Australia
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2014年 / 17卷 / 03期
关键词
Business process model; Repository; Query; SIMILARITY SEARCH; PETRI NETS; EFFICIENT; RETRIEVAL; FRAMEWORK;
D O I
10.1007/s11280-013-0210-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 model management, being able to efficiently query large amount of business process models is essential. For example, it is preferable to find a similar or related model to customize, rather than building a new one from scratch. This would not only save time, but would also be less error-prone and more coherent with the existing models of the enterprise. Querying large amounts of business process models efficiently is also vital during company amalgamation, in which business process models from multiple companies need to be examined and integrated. This paper provides: an overview of the field of querying business process models; a summary of its literature; and a list of challenges (and some potential solutions) that have yet to be addressed. In particular, we aim to compare the differences between querying business process models and general graph querying. We also discuss literature work from graph querying research that can be used when querying business process models.
引用
收藏
页码:427 / 454
页数:28
相关论文
共 77 条
[1]  
Abbaci K, 2011, LECT NOTES COMPUT SC, V7044, P38, DOI 10.1007/978-3-642-25109-2_4
[2]  
Agrawal R., P 20 INT C VERY LARG
[3]  
[Anonymous], 2007, P EMISA 2007
[4]  
[Anonymous], 2010, P 19 INT C WORLD WID
[5]  
[Anonymous], 2007, Proceedings of the 2007 ACM SIGMOD international conference on Management of data
[6]  
[Anonymous], 2003, An Applied Introduction
[7]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[8]   Semantic Querying of Business Process Models [J].
Awad, Ahmed ;
Polyvyanyy, Artem ;
Weske, Mathias .
EDOC 2008: 12TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING, PROCEEDINGS, 2008, :85-94
[9]  
Awad A, 2010, LECT NOTES COMPUT SC, V6193, P33, DOI 10.1007/978-3-642-14589-6_4
[10]  
Becker M., 2011, 1 INT WORKSH PROC MO, P39