Querying Graph-Relational Data
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866909701265948672 |
|---|---|
| author | Sullivan, Michael J. Chen, Zhibo Pranskevichus, Elvis Simmons, Robert J. Petrovykh, Victor Eržen, Aljaž Mur Selivanov, Yury |
| author_facet | Sullivan, Michael J. Chen, Zhibo Pranskevichus, Elvis Simmons, Robert J. Petrovykh, Victor Eržen, Aljaž Mur Selivanov, Yury |
| contents | For applications that store structured data in relational databases, there is an impedance mismatch between the flat representations encouraged by relational data models and the deeply nested information that applications expect to receive. In this work, we present the graph-relational database model, which provides a flexible, compositional, and strongly-typed solution to this "object-relational mismatch." We formally define the graph-relational database model and present a static and dynamic semantics for queries. In addition, we discuss the realization of the graph-relational database model in EdgeQL, a general-purpose SQL-style query language, and the Gel system, which compiles EdgeQL schemas and queries into PostgreSQL queries. Gel facilitates the kind of object-shaped data manipulation that is frequently provided inefficiently by object-relational mapping (ORM) technologies, while achieving most of the efficiency that comes from writing complex PostgreSQL queries directly. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16089 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Querying Graph-Relational Data Sullivan, Michael J. Chen, Zhibo Pranskevichus, Elvis Simmons, Robert J. Petrovykh, Victor Eržen, Aljaž Mur Selivanov, Yury Programming Languages Databases For applications that store structured data in relational databases, there is an impedance mismatch between the flat representations encouraged by relational data models and the deeply nested information that applications expect to receive. In this work, we present the graph-relational database model, which provides a flexible, compositional, and strongly-typed solution to this "object-relational mismatch." We formally define the graph-relational database model and present a static and dynamic semantics for queries. In addition, we discuss the realization of the graph-relational database model in EdgeQL, a general-purpose SQL-style query language, and the Gel system, which compiles EdgeQL schemas and queries into PostgreSQL queries. Gel facilitates the kind of object-shaped data manipulation that is frequently provided inefficiently by object-relational mapping (ORM) technologies, while achieving most of the efficiency that comes from writing complex PostgreSQL queries directly. |
| title | Querying Graph-Relational Data |
| topic | Programming Languages Databases |
| url | https://arxiv.org/abs/2507.16089 |