en-es
en-fr
en-sl
en
0.25
0.5
0.75
1.25
1.5
1.75
2
Explaining Graph Navigational Queries
Published on Jul 10, 2017837 Views
Graph navigational languages allow to specify pairs of nodes in a graph subject to the existence of paths satisfying a certain regular expression. Under this evaluation semantics, connectivity informa
Related categories
Chapter list
Explaining Graph Navigational Queries00:00
Explanations: an overview 00:20
Background03:17
To Explanation Graphs05:13
Contributions05:46
GeL’s Syntax06:47
Query Semantics08:04
Query Semantics - 109:05
Query Semantics - 210:17
Query Semantics - 310:41
Query Semantics - 411:51
Query Semantics - 512:30
Query Semantics - 613:13
An Example of G-soundness13:47
An Example of G-soundness - 114:14
Operators over Graphs14:44
Operators over Graphs - 116:13
Operators over Graphs - 216:31
Semantics - an overview17:07
Semantics - an overview - 118:32
Evaluation algorithm18:49
Translation into SPARQL19:33
Translation into SPARQL - 120:15
Evaluation (I)21:01
Evaluation (II)21:52
Concluding Remarks and Future Work22:41
Questions23:14