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)