Inference of Shape Graphs for Graph Databases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Inference of Shape Graphs for Graph Databases

Abstract

We investigate the problem of constructing a shape graph that describes the structure of a given graph database. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is both sound, i.e., always producing a schema that validates the input graph, and complete, i.e., able to produce any schema, within a given class of schemas, provided that a sufficiently informative input graph is presented. We identify a number of fundamental limitations that preclude feasible inference. We present inference algorithms based on natural approaches that allow to infer schemas that we argue to be of practical importance.
Fichier principal
Vignette du fichier
staworko-icdt22.pdf (801.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03559309 , version 1 (06-02-2022)

Identifiers

Cite

Benoît Groz, Aurélien Lemay, Slawomir Staworko, Piotr Wieczorek. Inference of Shape Graphs for Graph Databases. International Conference on Database Theory, 2022, Edinbourgh, United Kingdom. ⟨10.4230/LIPIcs.ICDT.2022.7⟩. ⟨hal-03559309⟩
115 View
98 Download

Altmetric

Share

Gmail Facebook X LinkedIn More