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...
Main Authors: | Dash, S, Staton, S |
---|---|
פורמט: | Conference item |
שפה: | English |
יצא לאור: |
Open Publishing Association
2021
|
פריטים דומים
-
Affine monads and lazy structures for Bayesian programming
מאת: Dash, S, et al.
יצא לאור: (2023) -
Monadic Queries over Tree−Structured Data
מאת: Gottlob, G, et al.
יצא לאור: (2002) -
Probabilistic Monads, Domains and Classical Information
מאת: Michael Mislove
יצא לאור: (2012-07-01) -
Flag and check: data access with monadically defined queries.
מאת: Rudolph, S, et al.
יצא לאור: (2013) -
Dichotomies for queries with negation in probabilistic databases
מאת: Fink, R, et al.
יצא לאור: (2016)