EUVIMEDEUVIMED entdecken
Crossref

Schema-Based Query Optimisation for Graph Databases

Chandan Sharma, Pierre Genevès, Nils Gesbert, Nabil Layaïda

Proceedings of the ACM on Management of Data · 10.02.2025 · 3 (1) · 1-29

DOI: 10.1145/3709722 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 11.02.2025. Verfasst von Chandan Sharma und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 112 Literaturangaben. Gefördert von: ANR.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 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.

Förderung

  • ANR

Zitieren

APA

Sharma, C., Genevès, P., Gesbert, N., & Layaïda, N. (2025). Schema-Based Query Optimisation for Graph Databases. Proceedings of the ACM on Management of Data, 3(1), 1-29. https://doi.org/10.1145/3709722

Vancouver

Sharma C, Genevès P, Gesbert N, Layaïda N. Schema-Based Query Optimisation for Graph Databases. Proceedings of the ACM on Management of Data. 2025;3(1):1-29. doi:10.1145/3709722

BibTeX
@article{Sharma2025,
  author = {Sharma, Chandan and Genevès, Pierre and Gesbert, Nils and Layaïda, Nabil},
  title = {Schema-Based Query Optimisation for Graph Databases},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2025},
  volume = {3},
  number = {1},
  pages = {1--29},
  doi = {10.1145/3709722}
}
Kostenlos starten →