Logo des Repositoriums
 
Konferenzbeitrag

Fast pattern matching in conceptual models – evaluating and extending a generic approach

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2011

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

Identifying structural patterns in conceptual models serves a variety of purposes ranging from model comparison to model integration and exploration. Although there are a multitude of different approaches for particular modelling languages and application scenarios, the modelling community lacks an integrated approach suitable for conceptual models of arbitrary languages and domains. Therefore, a generic set-theory based pattern matching approach has recently been developed. To prove that this approach is beneficial in terms of performance, we conduct a statistically rigorous analysis of its runtime behaviour. We augment the original approach to include a caching mechanism that further increases performance. We are able to show that the original algorithm is able to identify arbitrary patterns within milliseconds. The caching extension further increases performance by up to fifty per cent given the model base and patterns we used.

Beschreibung

Dietrich, Hanns-Alexander; Steinhorst, Matthias; Becker, Jörg; Delfmann, Patrick (2011): Fast pattern matching in conceptual models – evaluating and extending a generic approach. Enterprise modelling and information systems architectures (EMISA 2011). Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 978-3-88579-284-0. pp. 79-92. Regular Research Papers. Hamburg. September 22-23, 2011

Schlagwörter

Zitierform

DOI

Tags