• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Provenance Circuits for Trees and Treelike ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Permalink :
http://hdl.handle.net/20.500.12210/74881
Title :
Provenance Circuits for Trees and Treelike Instances
Author(s) :
Amarilli, Antoine [Auteur]
Data, Intelligence and Graphs [DIG]
Bourhis, Pierre [Auteur] refId
Linking Dynamic Data [LINKS ]
Senellart, Pierre [Auteur]
Data, Intelligence and Graphs [DIG]
National University of Singapore [NUS]
Conference title :
ICALP 2015
City :
Kyoto
Country :
Japon
Start date of the conference :
2015-06
Book title :
ICALP 2015
Publication date :
2015-06
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
English abstract : [en]
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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Submission date :
2022-06-13T02:40:32Z
Université de Lille

Mentions légales
Université de Lille © 2017