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)