DOI

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.

Original languageEnglish
Title of host publicationSUITE'11
Subtitle of host publicationProceedings of the 3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation
PublisherAssociation for Computing Machinery (ACM)
Pages5-8
Number of pages4
ISBN (Print)978-1-4503-0597-6
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation, SUITE 2011, Co-located with ICSE 2011 - Waikiki, Honolulu, HI, United States
Duration: 28 May 201128 May 2011

Conference

Conference3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation, SUITE 2011, Co-located with ICSE 2011
CountryUnited States
CityWaikiki, Honolulu, HI
Period28/05/1128/05/11

    Research areas

  • content based search, graph similarity, model search

ID: 36754878