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...
Hlavní autoři: | Gibbons, J, Henglein, F, Hinze, R, Wu, N |
---|---|
Médium: | Journal article |
Vydáno: |
Association for Computing Machinery
2018
|
Témata: |
Podobné jednotky
-
What you needa know about Yoneda: Profunctor optics and the Yoneda lemma
Autor: Boisseau, G, a další
Vydáno: (2018) -
Context-aware semantics-based information retrieval /
Autor: Kessler, Carsten
Vydáno: (c201) -
Effect of semantic distance on learning structured query language: An empirical study
Autor: Shin-Shing Shin
Vydáno: (2022-11-01) -
Semantic approaches for query expansion: taxonomy, challenges, and future research directions
Autor: Azzah Allahim, a další
Vydáno: (2025-03-01) -
Probabilistic ranking techniques in relational databases /
Autor: 525274 F. Ilyas, Ihab, a další
Vydáno: (2011)