Schema-Based Query Optimisation for Graph Databases
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912230107250688 |
|---|---|
| author | Sharma, Chandan Genevès, Pierre Gesbert, Nils Layaïda, Nabil |
| author_facet | Sharma, Chandan Genevès, Pierre Gesbert, Nils Layaïda, Nabil |
| contents | Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that describe how nodes and edges are organized. We propose a type inference mechanism that enriches recursive graph queries with relevant structural information contained in a graph schema. We show that this schema information can be useful in order to improve the performance when evaluating acylic recursive graph queries. Furthermore, we prove that the proposed method is sound and complete, ensuring that the semantics of the query is preserved during the schema-enrichment process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_01863 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Schema-Based Query Optimisation for Graph Databases Sharma, Chandan Genevès, Pierre Gesbert, Nils Layaïda, Nabil Databases Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that describe how nodes and edges are organized. We propose a type inference mechanism that enriches recursive graph queries with relevant structural information contained in a graph schema. We show that this schema information can be useful in order to improve the performance when evaluating acylic recursive graph queries. Furthermore, we prove that the proposed method is sound and complete, ensuring that the semantics of the query is preserved during the schema-enrichment process. |
| title | Schema-Based Query Optimisation for Graph Databases |
| topic | Databases |
| url | https://arxiv.org/abs/2403.01863 |