Abstract
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 language | English |
---|---|
Title of host publication | SUITE'11 |
Subtitle of host publication | Proceedings of the 3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation |
Publisher | Association for Computing Machinery (ACM) |
Pages | 5-8 |
Number of pages | 4 |
ISBN (Print) | 978-1-4503-0597-6 |
DOIs | |
Publication status | Published - 2011 |
Externally published | Yes |
Event | 3rd 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 2011 → 28 May 2011 |
Conference
Conference | 3rd International Workshop on Search-Driven Development: Users, Infrastructure, Tools, and Evaluation, SUITE 2011, Co-located with ICSE 2011 |
---|---|
Country/Territory | United States |
City | Waikiki, Honolulu, HI |
Period | 28/05/11 → 28/05/11 |
Keywords
- content based search
- graph similarity
- model search