Distributed Evaluation of Graph Queries using Recursive Relational Algebra
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916666754990080 |
|---|---|
| author | Chlyah, Sarah Genevès, Pierre Layaïda, Nabil |
| author_facet | Chlyah, Sarah Genevès, Pierre Layaïda, Nabil |
| contents | We present a system called Dist-$μ$-RA for the distributed evaluation of recursive graph queries. Dist-$μ$-RA builds on the recursive relational algebra and extends it with evaluation plans suited for the distributed setting. The goal is to offer expressivity for high-level queries while providing efficiency at scale and reducing communication costs. Experimental results on both real and synthetic graphs show the effectiveness of the proposed approach compared to existing systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_12487 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Distributed Evaluation of Graph Queries using Recursive Relational Algebra Chlyah, Sarah Genevès, Pierre Layaïda, Nabil Databases We present a system called Dist-$μ$-RA for the distributed evaluation of recursive graph queries. Dist-$μ$-RA builds on the recursive relational algebra and extends it with evaluation plans suited for the distributed setting. The goal is to offer expressivity for high-level queries while providing efficiency at scale and reducing communication costs. Experimental results on both real and synthetic graphs show the effectiveness of the proposed approach compared to existing systems. |
| title | Distributed Evaluation of Graph Queries using Recursive Relational Algebra |
| topic | Databases |
| url | https://arxiv.org/abs/2111.12487 |