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...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Sprog: | English |
| Udgivet: |
Open Publishing Association
2021
|
| _version_ | 1826271687531823104 |
|---|---|
| author | Dash, S Staton, S |
| author_facet | Dash, S Staton, S |
| author_sort | Dash, S |
| collection | OXFORD |
| description | 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 can be expressed in monad-based terms. We also extend this measurability result to a
fuller query language. Secondly, we discuss a distributive law between probability and bag monads, and we illustrate that this is useful for generating probabilistic databases.
|
| first_indexed | 2024-03-06T22:00:36Z |
| format | Conference item |
| id | oxford-uuid:4e758ca1-d35d-4caa-b8b5-4c367c110c3c |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T22:00:36Z |
| publishDate | 2021 |
| publisher | Open Publishing Association |
| record_format | dspace |
| spelling | oxford-uuid:4e758ca1-d35d-4caa-b8b5-4c367c110c3c2022-03-26T16:01:17ZMonads for measurable queries in probabilistic databasesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:4e758ca1-d35d-4caa-b8b5-4c367c110c3cEnglishSymplectic ElementsOpen Publishing Association2021Dash, SStaton, SWe 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 can be expressed in monad-based terms. We also extend this measurability result to a fuller query language. Secondly, we discuss a distributive law between probability and bag monads, and we illustrate that this is useful for generating probabilistic databases. |
| spellingShingle | Dash, S Staton, S Monads for measurable queries in probabilistic databases |
| title | Monads for measurable queries in probabilistic databases |
| title_full | Monads for measurable queries in probabilistic databases |
| title_fullStr | Monads for measurable queries in probabilistic databases |
| title_full_unstemmed | Monads for measurable queries in probabilistic databases |
| title_short | Monads for measurable queries in probabilistic databases |
| title_sort | monads for measurable queries in probabilistic databases |
| work_keys_str_mv | AT dashs monadsformeasurablequeriesinprobabilisticdatabases AT statons monadsformeasurablequeriesinprobabilisticdatabases |