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...
Hlavní autoři: | Dash, S, Staton, S |
---|---|
Médium: | Conference item |
Jazyk: | English |
Vydáno: |
Open Publishing Association
2021
|
Podobné jednotky
-
Affine monads and lazy structures for Bayesian programming
Autor: Dash, S, a další
Vydáno: (2023) -
Monadic Queries over Tree−Structured Data
Autor: Gottlob, G, a další
Vydáno: (2002) -
Probabilistic Monads, Domains and Classical Information
Autor: Michael Mislove
Vydáno: (2012-07-01) -
Flag and check: data access with monadically defined queries.
Autor: Rudolph, S, a další
Vydáno: (2013) -
Dichotomies for queries with negation in probabilistic databases
Autor: Fink, R, a další
Vydáno: (2016)