Proceedings of the 6th International Workshop on Automating Test Case Design, Selection and Evaluation 2015
DOI: 10.1145/2804322.2804324
|View full text |Cite
|
Sign up to set email alerts
|

A test model for graph database applications: an MDA-based approach

Abstract: NoSQL databases have given rise to new testing challenges due to the fact that they use data models and access modes to the data that differ from the relational databases. Testing relational database applications has attracted the interest of many researchers; but this is still not the case with NoSQL database applications. The approach presented in this paper defines a test model for graph database applications that takes into account the data model of this technology and the system specification. To automate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 34 publications
0
1
0
Order By: Relevance
“…Moreover, we aim at applying, evaluating, and optimizing our approach further w.r.t. other application scenarios such as test generation for the graph database domain [7], but also to other domains such as model-driven engineering, where our approach can be used, e.g., to generate test models for model transformations [5,19,30]. We also aim at generalizing our approach to more expressive graph properties able to encode, e.g., path-related properties [41,40,29].…”
Section: Discussionmentioning
confidence: 99%
“…Moreover, we aim at applying, evaluating, and optimizing our approach further w.r.t. other application scenarios such as test generation for the graph database domain [7], but also to other domains such as model-driven engineering, where our approach can be used, e.g., to generate test models for model transformations [5,19,30]. We also aim at generalizing our approach to more expressive graph properties able to encode, e.g., path-related properties [41,40,29].…”
Section: Discussionmentioning
confidence: 99%