Tractable Circuits in Database Theory
Type de document :
Article dans une revue scientifique: Article original
DOI :
Titre :
Tractable Circuits in Database Theory
Auteur(s) :
Amarilli, Antoine [Auteur]
Linking Dynamic Data [LINKS]
Département Informatique et Réseaux [INFRES]
Data, Intelligence and Graphs [DIG]
Capelli, Florent [Auteur]
Centre de Recherche en Informatique de Lens [CRIL]
Linking Dynamic Data [LINKS]
Département Informatique et Réseaux [INFRES]
Data, Intelligence and Graphs [DIG]
Capelli, Florent [Auteur]

Centre de Recherche en Informatique de Lens [CRIL]
Titre de la revue :
SIGMOD Record
Pagination :
6-20
Éditeur :
ACM
Date de publication :
2024-07-31
ISSN :
0163-5808
Discipline(s) HAL :
Informatique [cs]
Résumé en anglais : [en]
This work reviews how database theory uses tractable circuit classes from knowledge compilation. We present relevant query evaluation tasks, and notions of tractable circuits. We then show how these tractable circuits can ...
Lire la suite >This work reviews how database theory uses tractable circuit classes from knowledge compilation. We present relevant query evaluation tasks, and notions of tractable circuits. We then show how these tractable circuits can be used to address database tasks. We first focus on Boolean provenance and its applications for aggregation tasks, in particular probabilistic query evaluation. We study these for Monadic Second Order (MSO) queries on trees, and for safe Conjunctive Queries (CQs) and Union of Conjunctive Queries (UCQs). We also study circuit representations of query answers, and their applications to enumeration tasks: both in the Boolean setting (for MSO) and the multivalued setting (for CQs and UCQs).Lire moins >
Lire la suite >This work reviews how database theory uses tractable circuit classes from knowledge compilation. We present relevant query evaluation tasks, and notions of tractable circuits. We then show how these tractable circuits can be used to address database tasks. We first focus on Boolean provenance and its applications for aggregation tasks, in particular probabilistic query evaluation. We study these for Monadic Second Order (MSO) queries on trees, and for safe Conjunctive Queries (CQs) and Union of Conjunctive Queries (UCQs). We also study circuit representations of query answers, and their applications to enumeration tasks: both in the Boolean setting (for MSO) and the multivalued setting (for CQs and UCQs).Lire moins >
Langue :
Anglais
Comité de lecture :
Non
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- 2407.01127
- Accès libre
- Accéder au document