Semiring Provenance Over Graph Databases Tapp - King’S College London July 12, 2018
Preliminaries Provenance of an RPQ Experiments Conclusion Semiring Provenance over Graph Databases TaPP - King’s College London July 12, 2018 Joint work with Yann Ramusat Silviu Maniu, Pierre Senellart École normale supérieure Inria LRI 1/30 Preliminaries Provenance of an RPQ Experiments Conclusion Contents 1 Preliminaries Formal Definitions Known Algorithms 2 Provenance of an RPQ Graph Transformation Algorithms 3 Experiments STIF Network Results 4 Conclusion Conclusion 2/30 Preliminaries Provenance of an RPQ Experiments Conclusion Working example r a,5 a,0 s q b,3 a,2 t What if these integers represent time to move between two vertices and we want the minimum travel time between s and t? 3/30 Preliminaries Provenance of an RPQ Experiments Conclusion Working example r a,5 a,0 s q b,3 a,2 t What if these integers represent time to move between two vertices and we want the minimum travel time between s and t?2 3/30 Preliminaries Provenance of an RPQ Experiments Conclusion Working example r a,5 a,0 s q b,3 a,2 t What if these integers represent time to move between two vertices and we want the minimum travel time between s and t?2 And now if we only want to consider paths going through a b edge? 3/30 Preliminaries Provenance of an RPQ Experiments Conclusion Working example r a,5 a,0 s q b,3 a,2 t What if these integers represent time to move between two vertices and we want the minimum travel time between s and t?2 And now if we only want to consider paths going through a b edge? 8 3/30 Preliminaries Provenance of an RPQ Experiments Conclusion
[Show full text]