As the quantity of software artifacts, mainly source code and software models, stored in repositories increases, the need for their efficient search becomes more important. In this paper we propose content-based query (a.k.a query-by-example) approach for searching software model repositories, in order to retrieve significant models or model fragments. The query-by-example search conveys the user need in form of a model or pattern specified in a coarse way. Our approach incorporates analysis and indexing of models using textual information retrieval techniques, which exploit the knowledge of the metamodel the models conform to. This allows us to explore different segmentation granularities on models and different indexing techniques ranging from simple bag of words, to index structures which integrate metamodel information. We detail the proposed theoretical framework, the implementation of the method upon open-source architectures, and we discuss the results of our experiments upon a public dataset of UML models.

@en

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.

@en

Modern software project repositories provide support for both source code and design models that describe in details the data structure, behavior, and components of an application. We propose a graph matching-based technique between software models to address content-based query (a.k.a., query by example) on project repositories so as to retrieve significant model fragments for reuse. This can be extremely valuable in a scenario where the designer has a rough idea of the model or pattern he needs, he quickly sketches a coarse schema, and wants to retrieve projects that contain matching patterns (with all the details in place). Our approach encompasses the transformation of models into suitable graphs, the definition of a similarity function and an implementation within a search engine platform. In this paper we present the graph matching approach of the query model against the model repository and we evaluate different configurations of the similarity function.@en