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...
Autors principals: | Dash, S, Staton, S |
---|---|
Format: | Conference item |
Idioma: | English |
Publicat: |
Open Publishing Association
2021
|
Ítems similars
-
Affine monads and lazy structures for Bayesian programming
per: Dash, S, et al.
Publicat: (2023) -
Monadic Queries over Tree−Structured Data
per: Gottlob, G, et al.
Publicat: (2002) -
Probabilistic Monads, Domains and Classical Information
per: Michael Mislove
Publicat: (2012-07-01) -
Flag and check: data access with monadically defined queries.
per: Rudolph, S, et al.
Publicat: (2013) -
Dichotomies for queries with negation in probabilistic databases
per: Fink, R, et al.
Publicat: (2016)