TY - GEN
T1 - Graph-based search over web application model repositories
AU - Bislimovska, Bojana
AU - Bozzon, Alessandro
AU - Brambilla, Marco
AU - Fraternali, Piero
PY - 2011/7/18
Y1 - 2011/7/18
N2 - 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.
AB - 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.
KW - Graph Match
KW - Subgraph Isomorphism
KW - Query Graph
KW - Project Graph
KW - Model Repository
UR - http://www.scopus.com/inward/record.url?scp=79960278814&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22233-7_7
DO - 10.1007/978-3-642-22233-7_7
M3 - Conference contribution
AN - SCOPUS:79960278814
SN - 9783642222320
VL - 6757 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 90
EP - 104
BT - Web Engineering - 11th International Conference, ICWE 2011, Proceedings
PB - Springer
CY - Berlin
T2 - 11th International Conference on Web Engineering, ICWE 2011
Y2 - 20 June 2011 through 24 June 2011
ER -