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)