Explaining results of path queries on graphs: Single-path results for context-free path queries

Many graph query languages use, at their core, path queries that yield node pairs ( m , n ) that are connected by a path of interest. For the end-user, such node pairs only give limited insight as to why this result is obtained, as the pair does not directly identify the underlying path of interest. In this paper, we propose the single-path semantics to address this limitation of path queries. Under single-path semantics, path queries evaluate …