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).

翻译：本文综述了数据库理论如何利用知识编译中的可处理电路类。我们介绍了相关的查询评估任务以及可处理电路的概念，随后展示了这些可处理电路如何应用于解决数据库任务。我们首先聚焦于布尔溯源及其在聚合任务（特别是概率查询评估）中的应用。我们针对树上的单子二阶逻辑（MSO）查询、安全合取查询（CQs）以及合取查询的并集（UCQs）研究了这些应用。我们还探讨了查询答案的电路表示及其在枚举任务中的应用：包括布尔场景（针对MSO）和多值场景（针对CQs和UCQs）。