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)