This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Fourth International Conference on Internet and Web Applications and Services
Query Structural Information of BPEL Processes
Venice/Mestre, Italy
May 24-May 28
ISBN: 978-0-7695-3613-2
Reuse of proven process models increases modeling efficiency and ensure the quality of process models. To provide a better support for reuse, the retrieval mechanisms of process repositories should be able to propose similar process models that ranked according to their similarity degrees to the query request. As a process model and a query request on process structure can both be viewed as rooted, directed, and acyclic graphs, the problem of querying structural information of BPEL processes can be reduced to a graph matchmaking problem. In this paper we present a novel and efficient graph-based algorithm for querying structural information of BPEL processes based on an incomplete matchmaking semantics. Our algorithm performs in the worst case in polynomial time in the orders of the query graph and the process graph.
Index Terms:
query, bpel, graph algorithm, inexact matchmaking
Citation:
Zhilei Ma, Wei Lu, Frank Leymann, "Query Structural Information of BPEL Processes," iciw, pp.401-406, 2009 Fourth International Conference on Internet and Web Applications and Services, 2009
Usage of this product signifies your acceptance of the Terms of Use.