Efficient Retrieval of Similar Business Process Models Based on Structure

(Short Paper)
  • Tao Jin
  • Jianmin Wang
  • Lijie Wen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7044)


With the business process management technology being more widely used, there are more and more business process models, which are typically graphical. How to query such a large number of models efficiently is challenging. In this paper, we solve the problem of querying similar models efficiently based on structure. We use an index named TaskEdgeIndex for query processing. During query processing, we estimate the minimum number of edges that must be contained according to the given similarity threshold, and then obtain the candidate models through the index. Then we compute the similarity between the query condition model and every candidate model based on graph structure by using maximum common edge subgraph based similarity, and discard the candidate models that actually do not satisfy the similarity requirement. Since the number of candidate models is always much smaller than the size of repositories, the query efficiency is improved.


Business Process Query Processing Candidate Model Query Time Business Process Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Raymond, J.W., Gardiner, E.J., Willett, P.: RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs. Comput. J. 45(6), 631–644 (2002)CrossRefzbMATHGoogle Scholar
  2. 2.
    Yan, X., Yu, P.S., Han, J.: Substructure Similarity Search in Graph Databases. In: SIGMOD Conference, pp. 766–777 (2005)Google Scholar
  3. 3.
    Lohmann, N., Verbeek, E., Dijkman, R.M.: Petri Net Transformations for Business Processes - A Survey. T. Petri Nets and Other Models of Concurrency 2, 46–63 (2009)CrossRefGoogle Scholar
  4. 4.
    van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)CrossRefGoogle Scholar
  5. 5.
    Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  6. 6.
    Mendling, J., Reijers, H.A., van der Aalst, W.M.P.: Seven Process Modeling Guidelines (7PMG). Information & Software Technology 52(2), 127–136 (2010)CrossRefGoogle Scholar
  7. 7.
    Mahleko, B., Wombacher, A.: Indexing Business Processes based on Annotated Finite State Automata. In: ICWS, pp. 303–311 (2006)Google Scholar
  8. 8.
    Beeri, C., Eyal, A., Kamenkovich, S., Milo, T.: Querying Business Processes. In: VLDB, pp. 343–354 (2006)Google Scholar
  9. 9.
    Scheidegger, C.E., Vo, H.T., Koop, D., Freire, J., Silva, C.T.: Querying and Re-Using Workflows with VisTrails. In: SIGMOD Conference, pp. 1251–1254 (2008)Google Scholar
  10. 10.
    Shao, Q., Sun, P., Chen, Y.: WISE: A Workflow Information Search Engine. In: ICDE, pp. 1491–1494 (2009)Google Scholar
  11. 11.
    Sakr, S., Awad, A.: A Framework for Querying Graph-Based Business Process Models. In: WWW, pp. 1297–1300 (2010)Google Scholar
  12. 12.
    Jin, T., Wang, J., Wu, N., La Rosa, M., ter Hofstede, A.H.M.: Efficient and Accurate Retrieval of Business Process Models Through Indexing. In: Meersman, R., Dillon, T.S., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6426, pp. 402–409. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  13. 13.
    Jin, T., Wang, J., Wen, L.: Querying Business Process Models Based on Semantics. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part II. LNCS, vol. 6588, pp. 164–178. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  14. 14.
    Jin, T., Wang, J., Wen, L.: Efficient Retrieval of Similar Business Process Models Based on Behavior. Technical report. Tsinghua University (2011)Google Scholar
  15. 15.
    Yan, Z., Dijkman, R., Grefen, P.: Fast Business Process Similarity Search with Feature-Based Similarity Estimation. In: Meersman, R., Dillon, T.S., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6426, pp. 60–77. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tao Jin
    • 1
    • 2
  • Jianmin Wang
    • 2
  • Lijie Wen
    • 2
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityChina
  2. 2.School of SoftwareTsinghua UniversityChina

Personalised recommendations