Graph-Based Search over Web Application Model Repositories

  • Bojana Bislimovska
  • Alessandro Bozzon
  • Marco Brambilla
  • Piero Fraternali
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6757)


Model Driven Development may attain substantial productivity gains by exploiting a high level of reuse, across the projects of a same organization or public model repositories. For reuse to take place, developers must be able to perform effective searches across vast collections of models, locate model fragments of potential interest, evaluate the usefulness of the retrieved artifacts and eventually incorporate them in their projects. Given the variety of Web modeling languages, from general purpose to domain specific, from computation independent to platform independent, it is important to implement a search framework capable of harnessing the power of models and of flexibly adapting to the syntax and semantics of the modeling language. In this paper, we explore the use of graph-based similarity search as a tool for expressing queries over model repositories, uniformly represented as collections of labeled graphs. We discuss how the search approach can be parametrized and the impact of the parameters on the perceived quality of the search results.


Graph Match Subgraph Isomorphism Query Graph Project Graph Model Repository 
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.


  1. 1.
    Bozzon, A., Brambilla, M., Fraternali, P.: Searching Repositories of Web Application Models. In: International Conference on Web Engineering, pp. 1–15 (2010)Google Scholar
  2. 2.
    Brügger, A., Bunke, H., Dickinson, P., Riesen, K.: Generalized Graph Matching for Data Mining and Information Retrieval. Advances in Data Mining. Medical Applications, E-Commerce, Marketing, and Theoretical Aspects, 298–312Google Scholar
  3. 3.
    Ceri, S., Fraternali, P., Bongio, A., Brambilla, M., Comai, S., Matera, M.: Morgan Kaufmann series in data management systems: Designing data-intensive Web applications. Morgan Kaufmann Pub., San Francisco (2003)Google Scholar
  4. 4.
    Dijkman, R.M., Dumas, M., van Dongen, B.F., Käärik, R., Mendling, J.: Similarity of business process models: Metrics and evaluation. Inf. Syst. 36(2), 498–516 (2011)CrossRefGoogle Scholar
  5. 5.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)CrossRefGoogle Scholar
  6. 6.
    Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS) 20(4), 422–446 (2002)CrossRefGoogle Scholar
  7. 7.
    Kunze, M., Weske, M.: Metric trees for efficient similarity search in large process model repositories. In: Proceedings of the 1st International Workshop Process in the Large (IW-PL 2010), Hoboken, NJ (September 2010)Google Scholar
  8. 8.
    Lucrédio, D., Fortes, R.d.M., Whittle, J.: MOOGLE: A model search engine. Model Driven Engineering Languages and Systems, 296–310 (2010)Google Scholar
  9. 9.
    Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with cupid. In: Proceedings of the International Conference on Very Large Data Bases, Citeseer, pp. 49–58 (2001)Google Scholar
  10. 10.
    Markovic, I., Pereira, A.C., Stojanovic, N.: A framework for querying in business process modelling. In: Proceedings of the Multikonferenz Wirtschaftsinformatik (MKWI), Munchen, Germany (2008)Google Scholar
  11. 11.
    Messmer, B.: Efficient Graph Matching Algorithms for Preprocessed Model Graphs. PhD thesis, University of Bern, Switzerland (1996)Google Scholar
  12. 12.
    Nandi, A., Bernstein, P.A.: HAMSTER: using search clicklogs for schema and taxonomy matching. In: Proceedings of the VLDB Endowment, vol. 2(1), pp. 181–192 (2009)Google Scholar
  13. 13.
    Nowick, E.A., Eskridge, K.M., Travnicek, D.A., Chen, X., Li, J.: A model search engine based on cluster analysis of user search terms. Library Philosophy and Practice 7(2) (2005)Google Scholar
  14. 14.
    Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10(4), 334–350 (2001)CrossRefzbMATHGoogle Scholar
  15. 15.
    Remco Dijkman, M.D., Garcıa-Banuelos, L.: Graph matching algorithms for business process model similarity search. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 48–63. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  16. 16.
    Smith, K., Bonaceto, C., Wolf, C., Yost, B., Morse, M., Mork, P., Burdick, D.: Exploring schema similarity at multiple resolutions. In: Proceedings of the 2010 International Conference on Management of Data, pp. 1179–1182. ACM, New York (2010)Google Scholar
  17. 17.
    Spearman, C.: The proof and measurement of association between two things. The American Journal of Psychology 100(3-4), 441 (1904)Google Scholar
  18. 18.
    Syeda-Mahmood, T., Shah, G., Akkiraju, R., Ivan, A.A., Goodwin, R.: Searching service repositories by combining semantic and ontological matchingGoogle Scholar
  19. 19.
    Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: International Conference on Data Engineering, pp. 963–972 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Bojana Bislimovska
    • 1
  • Alessandro Bozzon
    • 1
  • Marco Brambilla
    • 1
  • Piero Fraternali
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations