Cumulated gain-based evaluation of IR techniques
ACM Transactions on Information Systems (TOIS)
Designing Data-Intensive Web Applications
Designing Data-Intensive Web Applications
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Generalized Graph Matching for Data Mining and Information Retrieval
ICDM '08 Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Graph Matching Algorithms for Business Process Model Similarity Search
BPM '09 Proceedings of the 7th International Conference on Business Process Management
HAMSTER: using search clicklogs for schema and taxonomy matching
Proceedings of the VLDB Endowment
Exploring schema similarity at multiple resolutions
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Searching repositories of web application models
ICWE'10 Proceedings of the 10th international conference on Web engineering
Similarity of business process models: Metrics and evaluation
Information Systems
Semantic collaborative tagging for web APIs sharing and reuse
ICWE'12 Proceedings of the 12th international conference on Web Engineering
Textual and Content-Based Search in Repositories of Web Application Models
ACM Transactions on the Web (TWEB)
| Hi-index | 0.00 |
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.