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)