Provenance Circuits for Trees and Treelike Instances

Abstract :

Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been extended to several tasks related to query evaluation, such as counting query results or performing query evaluation on probabilistic trees. These are two examples of the more general problem of computing augmented query output, that is referred to as provenance. This article presents a provenance framework for trees and treelike instances, by describing a linear-time construction of a circuit provenance representation for MSO queries. We show how this provenance can be connected to the usual definitions of semiring provenance on relational instances, even though we compute it in an unusual way, using tree automata; we do so via intrinsic definitions of provenance for general semirings, independent of the operational details of query evaluation. We show applications of this provenance to capture existing counting and probabilistic results on trees and treelike instances, and give novel consequences for probability evaluation.

Document type :
Conference papers
Complete list of metadatas

https://hal-imt.archives-ouvertes.fr/hal-01178399
Contributor : Admin Télécom Paristech <>
Submitted on : Monday, July 20, 2015 - 3:27:38 AM
Last modification on : Friday, June 7, 2019 - 11:07:09 AM

Identifiers

  • HAL Id : hal-01178399, version 1

Citation

Antoine Amarilli, Pierre Bourhis, Pierre Senellart. Provenance Circuits for Trees and Treelike Instances. ICALP 2015, Jun 2015, Kyoto, Japan. pp.56-68. ⟨hal-01178399⟩

Share

Metrics

Record views

362