Difference between revisions of "WG211/M18Gibbons"
| Line 1: | Line 1: | ||
| − | '''Relational Algebra by Way of Adjunctions''' by Jeremy Gibbons (based on joint work with Fritz Henglein, Ralf Hinze, and Nicolas Wu; this is an extension to the work I reported at [[ | + | '''Relational Algebra by Way of Adjunctions''' by Jeremy Gibbons (based on joint work with Fritz Henglein, Ralf Hinze, and Nicolas Wu; this is an extension to the work I reported at [[WG211/M15Schedule | Meeting 15 in London]]) |
Bulk types such as sets, bags, and lists are monads, and therefore | Bulk types such as sets, bags, and lists are monads, and therefore | ||
Latest revision as of 11:31, 23 May 2018
Relational Algebra by Way of Adjunctions by Jeremy Gibbons (based on joint work with Fritz Henglein, Ralf Hinze, and Nicolas Wu; this is an extension to the work I reported at Meeting 15 in London)
Bulk types such as sets, bags, and lists are monads, and therefore support a notation for database queries based on comprehensions. This fact is the basis of much work on database query languages. The monadic structure easily explains most of standard relational algebra - specifically, selections and projections - allowing for an elegant mathematical foundation for those aspects of database query language design. Most, but not all: monads do not immediately offer an explanation of relational join or grouping, and hence important foundations for those crucial aspects of relational algebra are missing. The best they can offer is cartesian product followed by selection. Adjunctions come to the rescue: like any monad, bulk types also arise from certain adjunctions; we show that by paying due attention to other important adjunctions, we can elegantly explain the rest of standard relational algebra. In particular, this leads directly to an efficient implementation, even of joins.
