Graph-based search over web application model repositories

Conference Paper (2011)
Author(s)

Bojana Bislimovska (Politecnico di Milano)

A. Bozzon (Politecnico di Milano)

Marco Brambilla (Politecnico di Milano)

Piero Fraternali (Politecnico di Milano)

Affiliation
External organisation
DOI related publication
https://doi.org/10.1007/978-3-642-22233-7_7
More Info
expand_more
Publication Year
2011
Language
English
Affiliation
External organisation
Volume number
6757 LNCS
Pages (from-to)
90-104
ISBN (print)
9783642222320
ISBN (electronic)
978-3-642-22233-7

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.

No files available

Metadata only record. There are no files for this record.