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...
Κύριοι συγγραφείς: | Dash, S, Staton, S |
---|---|
Μορφή: | Conference item |
Γλώσσα: | English |
Έκδοση: |
Open Publishing Association
2021
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Affine monads and lazy structures for Bayesian programming
ανά: Dash, S, κ.ά.
Έκδοση: (2023) -
Monadic Queries over Tree−Structured Data
ανά: Gottlob, G, κ.ά.
Έκδοση: (2002) -
Probabilistic Monads, Domains and Classical Information
ανά: Michael Mislove
Έκδοση: (2012-07-01) -
Flag and check: data access with monadically defined queries.
ανά: Rudolph, S, κ.ά.
Έκδοση: (2013) -
Dichotomies for queries with negation in probabilistic databases
ανά: Fink, R, κ.ά.
Έκδοση: (2016)