Relational algebra by way of adjunctions
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...
Main Authors: | Gibbons, J, Henglein, F, Hinze, R, Wu, N |
---|---|
Format: | Journal article |
Published: |
Association for Computing Machinery
2018
|
Subjects: |
Similar Items
-
What you needa know about Yoneda: Profunctor optics and the Yoneda lemma
by: Boisseau, G, et al.
Published: (2018) -
Context-aware semantics-based information retrieval /
by: Kessler, Carsten
Published: (c201) -
Effect of semantic distance on learning structured query language: An empirical study
by: Shin-Shing Shin
Published: (2022-11-01) -
Semantic approaches for query expansion: taxonomy, challenges, and future research directions
by: Azzah Allahim, et al.
Published: (2025-03-01) -
Probabilistic ranking techniques in relational databases /
by: 525274 F. Ilyas, Ihab, et al.
Published: (2011)