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.

Original languageEnglish
Title of host publicationWeb Engineering - 11th International Conference, ICWE 2011, Proceedings
Place of PublicationBerlin
PublisherSpringer
Pages90-104
Number of pages15
Volume6757 LNCS
ISBN (Electronic)978-3-642-22233-7
ISBN (Print)9783642222320
DOIs
Publication statusPublished - 18 Jul 2011
Externally publishedYes
Event11th International Conference on Web Engineering, ICWE 2011 - Berlin, Germany, Paphos, Cyprus
Duration: 20 Jun 201124 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6757 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Web Engineering, ICWE 2011
CountryCyprus
CityPaphos
Period20/06/1124/06/11

    Research areas

  • Graph Match, Subgraph Isomorphism, Query Graph, Project Graph, Model Repository

ID: 45468614