Rel: A Programming Language for Relational Data

Aref, M; Guagliardo, P; Kastrinis, G; Libkin L.; Marsault V.; Martens W.; McGrath, M; Murlak F.; Nystrom, N; Peterfreund, L; Rogers A.; Sirangelo, C; Vrgoc, D; Zhao, D; Zreika, A

Keywords: Relational data model, programming in the large, relational programming, query language design, impedance mismatch, relational knowledge graph, graph normal form

Abstract

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. © 2025 ACM.

Más información

Título según WOS: Rel: A Programming Language for Relational Data
Título de la Revista: Proceedings of the ACM SIGMOD International Conference on Management of Data
Editorial: Association for Computing Machinery
Fecha de publicación: 2025
Página de inicio: 283
Página final: 296
Idioma: English
DOI:

10.1145/3722212.3724450

Notas: ISI