Graph-Based Search over Web Application Model Repositories

  • Bojana Bislimovska
  • Alessandro Bozzon
  • Marco Brambilla
  • Piero Fraternali
Conference paper

DOI: 10.1007/978-3-642-22233-7_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6757)
Cite this paper as:
Bislimovska B., Bozzon A., Brambilla M., Fraternali P. (2011) Graph-Based Search over Web Application Model Repositories. In: Auer S., Díaz O., Papadopoulos G.A. (eds) Web Engineering. ICWE 2011. Lecture Notes in Computer Science, vol 6757. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

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