Work

Semiring Provenance over Graph Databases

Year: 2018

Type: conference-paper

Abstract: We generalize three existing graph algorithms to compute the provenance of regular path queries over graph databases, in the framework of provenance semirings – algebraic structures that can capture different forms of provenance. Each algorithm yields a different trade-off between time complexity and generality, as each requires different properties over the semiring. Together, these algorithms cover a large class of semirings used for provenance (top-k, security, etc.). Experimental results suggest these approaches are complementary and practical for various kinds of provenance indications, even on a relatively large transport network.

Source: HAL

Authors: Ramusat, Yann, Maniu, Silviu, Senellart, Pierre

Institutions: École Normale Supérieure - PSL, Département d'Informatique, VALDA: Valeur à partir des données, Université Paris-Sud, Laboratoire de Recherche en Informatique, Télécom Paris, Laboratoire Traitement et Communication de l’Information

Language: English

Topic: Graph Theory and Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2886969741

FWCI: 1.609

Cites: 9

Cited by: 9

Related to: 10