Affiliation:
1. DI ENS, ENS, CNRS, PSL Research University & Inria Paris<CI, Télécom ParisTech, Paris, France
Abstract
We review the basics of data provenance in relational databases. We describe different provenance formalisms, from Boolean provenance to provenance semirings and beyond, that can be used for a wide variety of purposes, to obtain additional information on the output of a query. We discuss representation systems for data provenance, circuits in particular, with a focus on practical implementation. Finally, we explain how provenance is practically used for probabilistic query evaluation in probabilistic databases.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference48 articles.
1. Provenance Circuits for Trees and Treelike Instances
2. Tractable Lineages on Treelike Instances
3. Antoine Amarilli and Mikaël Monet. Example of a naturally ordered semiring which is not an m-semiring. http://math.stackexchange. com/questions/1966858 2016. Antoine Amarilli and Mikaël Monet. Example of a naturally ordered semiring which is not an m-semiring. http://math.stackexchange. com/questions/1966858 2016.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献