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
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Semantic Querying of Business Process Models
EDOC '08 Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference
TALE: A Tool for Approximate Large Graph Matching
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
WISE: A Workflow Information Search Engine
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Exploring schema repositories with schemr
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Graph Matching Algorithms for Business Process Model Similarity Search
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Searching repositories of web application models
ICWE'10 Proceedings of the 10th 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 |
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.