Monads for Measurable Queries in Probabilistic Databases
arXiv:2112.14048 · doi:10.4204/EPTCS.351.3
Abstract
We consider a bag (multiset) monad on the category of standard Borel spaces, and show that it gives a free measurable commutative monoid. Firstly, we show that a recent measurability result for probabilistic database queries (Grohe and Lindner, ICDT 2020) follows quickly from the fact that queries can be expressed in monad-based terms. We also extend this measurability result to a fuller query language. Secondly, we discuss a distributive law between probability and bag monads, and we illustrate that this is useful for generating probabilistic databases.
arXiv commentIn Proceedings MFPS 2021, arXiv:2112.13746
References in corpus (5)
- A Convenient Category for Higher-Order Probability Theory
- Mixed powerdomains for probability and nondeterminism
- A Monad for Probabilistic Point Processes
- Discrete-Continuous Mixtures in Probabilistic Programming: Generalized Semantics and Inference Algorithms
- Multinomial and Hypergeometric Distributions in Markov Categories