Provenance for Regular Path Queries
Formal Languages and Automata Theory
2020-02-04 v2
Abstract
Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs of objects, which are connected by paths spelling words in the language of the regular path query. Often the database edges come with a weights assoaciated to them. Such weights can distances, levels of discomfort, multiplicities, etc. We model weights using semiring frameworks.
Cite
@article{arxiv.2001.09864,
title = {Provenance for Regular Path Queries},
author = {Gosta Grahne and Alex Thomo},
journal= {arXiv preprint arXiv:2001.09864},
year = {2020}
}