Towards optimisation of model queries: A parallel execution approach

Sina Madani; Dimitris Kolovos; Richard F. Paigea

doi:10.5381/JOT.2019.18.2.A3

Towards optimisation of model queries: A parallel execution approach

Sina Madani, Dimitris Kolovos, Richard F. Paigea

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The growing size of software models poses significant scalability challenges. Amongst these challenges is the execution time of queries and transformations. In many cases, model management programs are (or can be) expressed as chains and combinations of core fundamental operations. Most of these operations are pure functions, making them amenable to parallelisation, lazy evaluation and short-circuiting. In this paper we show how all three of these optimisations can be combined in the context of Epsilon: an OCL-inspired family of model management languages. We compare our solutions with both interpreted and compiled OCL as well as hand-written Java code. Our experiments show a significant improvement in the performance of queries, especially on large models.

Original language	English
Article number	A3
Journal	Journal of Object Technology
Volume	18
Issue number	2
DOIs	https://doi.org/10.5381/JOT.2019.18.2.A3
Publication status	Published - 1 Jul 2019

Keywords

Epsilon
OCL
Query performance
Scalability

Access to Document

10.5381/JOT.2019.18.2.A3

Towards Optimisation of Model Queries: A Parallel Execution ApproachFinal published version, 679 KBLicence: CC BY

Cite this

@article{e076ddeb9d3d4cf19f710fd7549807c8,

title = "Towards optimisation of model queries: A parallel execution approach",

abstract = "The growing size of software models poses significant scalability challenges. Amongst these challenges is the execution time of queries and transformations. In many cases, model management programs are (or can be) expressed as chains and combinations of core fundamental operations. Most of these operations are pure functions, making them amenable to parallelisation, lazy evaluation and short-circuiting. In this paper we show how all three of these optimisations can be combined in the context of Epsilon: an OCL-inspired family of model management languages. We compare our solutions with both interpreted and compiled OCL as well as hand-written Java code. Our experiments show a significant improvement in the performance of queries, especially on large models.",

keywords = "Epsilon, OCL, Query performance, Scalability",

author = "Sina Madani and Dimitris Kolovos and Paigea, {Richard F.}",

year = "2019",

month = jul,

day = "1",

doi = "10.5381/JOT.2019.18.2.A3",

language = "English",

volume = "18",

journal = "Journal of Object Technology",

issn = "1660-1769",

publisher = "Journal of Object Technology",

number = "2",

}

TY - JOUR

T1 - Towards optimisation of model queries

T2 - A parallel execution approach

AU - Madani, Sina

AU - Kolovos, Dimitris

AU - Paigea, Richard F.

PY - 2019/7/1

Y1 - 2019/7/1

N2 - The growing size of software models poses significant scalability challenges. Amongst these challenges is the execution time of queries and transformations. In many cases, model management programs are (or can be) expressed as chains and combinations of core fundamental operations. Most of these operations are pure functions, making them amenable to parallelisation, lazy evaluation and short-circuiting. In this paper we show how all three of these optimisations can be combined in the context of Epsilon: an OCL-inspired family of model management languages. We compare our solutions with both interpreted and compiled OCL as well as hand-written Java code. Our experiments show a significant improvement in the performance of queries, especially on large models.

AB - The growing size of software models poses significant scalability challenges. Amongst these challenges is the execution time of queries and transformations. In many cases, model management programs are (or can be) expressed as chains and combinations of core fundamental operations. Most of these operations are pure functions, making them amenable to parallelisation, lazy evaluation and short-circuiting. In this paper we show how all three of these optimisations can be combined in the context of Epsilon: an OCL-inspired family of model management languages. We compare our solutions with both interpreted and compiled OCL as well as hand-written Java code. Our experiments show a significant improvement in the performance of queries, especially on large models.

KW - Epsilon

KW - OCL

KW - Query performance

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=85083157374&partnerID=8YFLogxK

U2 - 10.5381/JOT.2019.18.2.A3

DO - 10.5381/JOT.2019.18.2.A3

M3 - Article

AN - SCOPUS:85083157374

SN - 1660-1769

VL - 18

JO - Journal of Object Technology

JF - Journal of Object Technology

IS - 2

M1 - A3

ER -

Towards optimisation of model queries: A parallel execution approach

Abstract

Keywords

Access to Document

Other files and links

Cite this