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.
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.
Original language | English |
---|---|
Title of host publication | Companion of the 2025 International Conference on Management of Data (SIGMOD-Companion ’25) |
Publisher | Association for Computing Machinery (ACM) |
Pages | 1-14 |
Number of pages | 14 |
DOIs | |
Publication status | Accepted/In press - 26 Feb 2025 |
Event | The 2025 ACM SIGMOD/PODS International Conference on Management of Data - Intercontinental Berlin, Berlin, Germany Duration: 22 Jun 2025 → 27 Jun 2025 https://2025.sigmod.org/ |
Conference
Conference | The 2025 ACM SIGMOD/PODS International Conference on Management of Data |
---|---|
Abbreviated title | SIGMOD/PODS 2025 |
Country/Territory | Germany |
City | Berlin |
Period | 22/06/25 → 27/06/25 |
Internet address |
Keywords / Materials (for Non-textual outputs)
- relational data model
- programming in the large
- relational programming
- query language design
- impedance mismatch
- relational knowledge graph
- graph normal form