This work reviews how database theory uses tractable circuit classes from knowledge
compilation. We present relevant query evaluation tasks, and notions of tractable circuits …

The area of Principles of Data Management (PDM) has made crucial contributions to the
development of formal frameworks for understanding and managing data and knowledge …

Data provenance has evolved from a niche topic to a mainstream area of research in
databases and other research communities. This article gives a comprehensive introduction …

Treewidth is a parameter that measures how tree-like a relational instance is, and whether it
can reasonably be decomposed into a tree. Many computation tasks are known to be …

Probabilistic data is motivated by the need to model uncertainty in large databases. Over the
last twenty years or so, both the Database community and the AI community have studied …

We review the basics of data provenance in relational databases. We describe different
provenance formalisms, from Boolean provenance to provenance semirings and beyond …

This document is an introduction to two related formalisms to define Boolean functions:
binary decision diagrams, and Boolean circuits. It presents these formalisms and several of …

We study the problem of enumerating the satisfying valuations of a circuit while bounding
the delay, ie, the time needed to compute each successive valuation. We focus on the class …

The field of knowledge compilation establishes the tractability of many tasks by studying how
to compile them to Boolean circuit classes obeying some requirements such as …

We give an algorithm to enumerate the results on trees of monadic second-order (MSO)
queries represented by nondeterministic tree automata. After linear time preprocessing (in …