Querying UML Models using OCL and Prolog: A Performance Study

Querying UML Models using OCL and Prolog: A Performance Study
复制标题

使用 OCL 和 Prolog 查询 UML 模型:性能研究

DOI:
--
复制
发表时间:
2008
期刊:
2008 IEEE International Conference on Software Testing Verification and Validation Workshop
影响因子:
--
通讯作者:
Christian Lange
Christian Lange
中科院分区:
--
文献类型:
--
作者:
Joanna Chimiak;M. Felderer;C. Lenz;Christian Lange

文献摘要

被引文献

相似文献

实际中使用的统一建模语言(UML)模型的规模非常大,涉及的类多达数百个和数千个。通过对这些模型的查询,通过信息过滤和聚合来支持其质量评估。无论是人类认知还是自动分析,都需要快速查询。在这种情况下,模型查询的性能成为一个重要的问题。我们研究了两种不同的查询引擎的性能特点:一种使用对象约束语言(OCL),另一种使用PROLOG。我们的比较是基于两种语言中的对等查询。我们将查询应用于10000个类别的118个模型,以分析模型负载和评估时间。我们的初步结果表明,如果查询的执行时间是线性的,则Prolog的执行速度更快。在其中一种情况下,PROLOG的执行时间是非线性的,因此较高。进一步的研究应侧重于反映表现力方面的性能分析。我们的实验材料是可以访问的,以便将来能够复制这项研究。
The size of unified modeling language (UML) models used in practice is very large and ranges up to hundreds and thousands of classes. Querying of these models is used to support their quality assessment by information filtering and aggregating. For both, human cognition and automated analysis, there is a need for fast querying. In this context performance of model queries becomes an important issue. We investigated performance characteristics of two different querying engines: one using the object constraint language (OCL) and the other using prolog. Our comparison is based on equivalent queries in both languages. We applied the queries to 118 models of a size up to 10000 classes to analyze model load and evaluation time. Our preliminary results show that if execution time of queries is linear then prolog is faster. For one of the presented cases, the execution time in prolog was nonlinear and thus higher. Further studies should focus on a performance analysis reflecting expressiveness aspects. Our experimental material is accessible to enable future replications of this study.