2018
DOI: 10.1007/978-3-030-04771-9_29
|View full text |Cite
|
Sign up to set email alerts
|

Model Based Development of Data Integration in Graph Databases Using Triple Graph Grammars

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…In [13], the main features of a data management system based on graphs have been proposed where the underlying typed attributed data graphs are different from those of RDF and SPARQL. In [2], triple graph grammars (TGG) have also been used for data modelling and model transformation rules to be compiled into Graph Data Bases code for execution.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In [13], the main features of a data management system based on graphs have been proposed where the underlying typed attributed data graphs are different from those of RDF and SPARQL. In [2], triple graph grammars (TGG) have also been used for data modelling and model transformation rules to be compiled into Graph Data Bases code for execution.…”
Section: Discussionmentioning
confidence: 99%
“…Let m 1 , ..., m k be the matches from L to G. Consider the basic construct query (k L, k R). Let m be the match from k L to G that coincides with m i on the i-th component of k L. The high-level query result of (L, R) against G is the result H high of applying the POIM transformation map PoIm k L,k R to the match m : k L → G, as in Diagram (2).…”
Section: The High-level Calculusmentioning
confidence: 99%