Efficient and Exact Query of Large Process Model Repositories in Cloud Workflow Systems

As cloud computing platforms are widely accepted by more and more enterprises and individuals, the underlying cloud workflow systems accumulate large numbers of business process models. Retrieving and recommending the most similar process models according to the tenant's requirements become extremely important, for it is not only beneficial to promote the reuse of the existing model assets, but also helpful to reduce the error rate of the modeling process. Since the scales of cloud workflow repositories become bigger and bigger, developing efficient and exact query approaches is urgent. To this end, an improved two-stage exact query approach based on graph structure is proposed. In the filtering stage, the composite task index, which consists of the label, join-attribute and split-attribute of a task, is adopted to acquire candidate models, which can greatly reduce the number of process models needed to be tested by a time-consuming verification algorithm. In the verification stage, a novel subgraph isomorphism test based on task code is proposed to refine the candidate model set. Experiments are conducted on six synthetic model sets and two real model sets. The results demonstrate that the presented approach can significantly improve the query efficiency and reduce the query response time.

[1]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[2]  Li Xiang,et al.  Automatic Service Discovery Framework Based on Business Process Similarity , 2012 .

[3]  Philip S. Yu,et al.  Graph indexing based on discriminative frequent structure analysis , 2005, TODS.

[4]  Yun Peng,et al.  Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases , 2014, IEEE Transactions on Services Computing.

[5]  Tao Jin,et al.  Querying Business Process Models Based on Semantics , 2011, DASFAA.

[6]  Philip S. Yu,et al.  Graph Indexing: Tree + Delta >= Graph , 2007, VLDB.

[7]  Sherif Sakr,et al.  Querying Graph-Based Repositories of Business Process Models , 2010, DASFAA Workshops.

[8]  Boudewijn F. van Dongen,et al.  The ProM Framework: A New Era in Process Mining Tool Support , 2005, ICATPN.

[9]  马应龙,et al.  A graph distance based metric for data oriented workflow retrieval with variable time constraints , 2014 .

[10]  Tao Jin,et al.  Efficient Retrieval of Similar Workflow Models Based on Behavior , 2012, APWeb.

[11]  Shijie Zhang,et al.  TreePi: A Novel Graph Indexing Method , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[12]  Mu Qiao,et al.  Towards Efficient Business Process Clustering and Retrieval: Combining Language Modeling and Structure Matching , 2011, BPM.

[13]  Tao Jin,et al.  Efficient querying of large process model repositories , 2013, Comput. Ind..

[14]  Mathias Weske,et al.  Metric Trees for Efficient Similarity Search in Large Process Model Repositories , 2010, Business Process Management Workshops.

[15]  Yi Chen,et al.  WISE: A Workflow Information Search Engine , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[16]  Cao Jian,et al.  Cloud Computing Oriented Workflow Technology , 2012 .

[17]  Tongdan Jin,et al.  Efficient and accurate retrieval of business process models through indexing , 2010 .

[18]  Arthur H. M. ter Hofstede,et al.  Indexing and Efficient Instance-Based Retrieval of Process Models Using Untanglings , 2014, CAiSE.

[19]  Sherif Sakr,et al.  A framework for querying graph-based business process models , 2010, WWW '10.

[20]  Wilfred Ng,et al.  Efficient query processing on graph databases , 2009, TODS.

[21]  Khurram Shahzad,et al.  Requirements for a Business Process Model Repository: A Stakeholders' Perspective , 2010, BIS.

[22]  Ralf Laue,et al.  A comparative survey of business process similarity measures , 2012, Comput. Ind..

[23]  Philip S. Yu,et al.  Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.

[24]  Tao Jin,et al.  Querying business process model repositories , 2014, World Wide Web.

[25]  Klaus Moessner,et al.  Probabilistic Matchmaking Methods for Automated Service Discovery , 2014, IEEE Transactions on Services Computing.

[26]  Patrick Delfmann,et al.  Supporting Business Process Improvement through Business Process Weakness Pattern Collections , 2015, Wirtschaftsinformatik.

[27]  Tom Baeyens,et al.  BPM in the Cloud , 2013, BPM.

[28]  Remco M. Dijkman,et al.  Similarity Search of Business Process Models , 2009, IEEE Data Eng. Bull..

[29]  Philip S. Yu,et al.  GString: A Novel Approach for Efficient Search in Graph Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[30]  Mathias Weske,et al.  Semantic Querying of Business Process Models , 2008, 2008 12th International IEEE Enterprise Distributed Object Computing Conference.

[31]  Wilfred Ng,et al.  Fg-index: towards verification-free query processing on graph databases , 2007, SIGMOD '07.

[32]  Paul W. P. J. Grefen,et al.  FNet: An Index for Advanced Business Process Querying , 2012, BPM.

[33]  Jan Mendling,et al.  Seven process modeling guidelines (7PMG) , 2010, Inf. Softw. Technol..

[34]  Jan Mendling,et al.  Listen to Me: Improving Process Model Matching through User Feedback , 2014, BPM.

[35]  Dennis Shasha,et al.  Algorithmics and applications of tree and graph searching , 2002, PODS.

[36]  Moe Thandar Wynn,et al.  Reduction rules for YAWL workflows with cancellation regions and OR-joins , 2009, Inf. Softw. Technol..