Monads for measurable queries in probabilistic databases
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 c...
Autori principali: | Dash, S, Staton, S |
---|---|
Natura: | Conference item |
Lingua: | English |
Pubblicazione: |
Open Publishing Association
2021
|
Documenti analoghi
-
Affine monads and lazy structures for Bayesian programming
di: Dash, S, et al.
Pubblicazione: (2023) -
Monadic Queries over Tree−Structured Data
di: Gottlob, G, et al.
Pubblicazione: (2002) -
Probabilistic Monads, Domains and Classical Information
di: Michael Mislove
Pubblicazione: (2012-07-01) -
Flag and check: data access with monadically defined queries.
di: Rudolph, S, et al.
Pubblicazione: (2013) -
Dichotomies for queries with negation in probabilistic databases
di: Fink, R, et al.
Pubblicazione: (2016)