Rel: A Programming Language for Relational Data
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912344711364608 |
|---|---|
| author | Aref, Molham Guagliardo, Paolo Kastrinis, George Libkin, Leonid Marsault, Victor Martens, Wim McGrath, Mary Murlak, Filip Nystrom, Nathaniel Peterfreund, Liat Rogers, Allison Sirangelo, Cristina Vrgoc, Domagoj Zhao, David Zreika, Abdul |
| author_facet | Aref, Molham Guagliardo, Paolo Kastrinis, George Libkin, Leonid Marsault, Victor Martens, Wim McGrath, Mary Murlak, Filip Nystrom, Nathaniel Peterfreund, Liat Rogers, Allison Sirangelo, Cristina Vrgoc, Domagoj Zhao, David Zreika, Abdul |
| contents | From the moment of their inception, languages for relational data have been described as sublanguages embedded in a host programming language. Rel is a new relational language whose key design goal is to go beyond this paradigm with features that allow for programming in the large, making it possible to fully describe end to end application semantics. With the new approach we can model the semantics of entire enterprise applications relationally, which helps significantly reduce architecture complexity and avoid the well-known impedance mismatch problem. This paradigm shift is enabled by 50 years of database research, making it possible to revisit the sublanguage/host language paradigm, starting from the fundamental principles. We present the main features of Rel: those that give it the power to express traditional query language operations and those that are designed to grow the language and allow programming in the large. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10323 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rel: A Programming Language for Relational Data Aref, Molham Guagliardo, Paolo Kastrinis, George Libkin, Leonid Marsault, Victor Martens, Wim McGrath, Mary Murlak, Filip Nystrom, Nathaniel Peterfreund, Liat Rogers, Allison Sirangelo, Cristina Vrgoc, Domagoj Zhao, David Zreika, Abdul Databases Programming Languages From the moment of their inception, languages for relational data have been described as sublanguages embedded in a host programming language. Rel is a new relational language whose key design goal is to go beyond this paradigm with features that allow for programming in the large, making it possible to fully describe end to end application semantics. With the new approach we can model the semantics of entire enterprise applications relationally, which helps significantly reduce architecture complexity and avoid the well-known impedance mismatch problem. This paradigm shift is enabled by 50 years of database research, making it possible to revisit the sublanguage/host language paradigm, starting from the fundamental principles. We present the main features of Rel: those that give it the power to express traditional query language operations and those that are designed to grow the language and allow programming in the large. |
| title | Rel: A Programming Language for Relational Data |
| topic | Databases Programming Languages |
| url | https://arxiv.org/abs/2504.10323 |