1 citations · 1 across the 5 of their papers we have counts for
7 papers
On the generic information capacity of relational schemas with a single binary relation
Benoît Groz, Jan Hidders, Nina Pardal +2
We consider database schemas consisting of a single binary relation, with key constraints and inclusion dependencies. Over this space of 20 schemas, we completely characterize when…
The KG-ER Conceptual Schema Language
Enrico Franconi, Benoît Groz, Jan Hidders +4
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, pr…
Cutwidth Bounds via Vertex Partitions
Antoine Amarilli, Benoît Groz
We study the cutwidth measure on graphs and ways to bound the cutwidth of a graph by partitioning its vertices. We consider bounds expressed as a function of two quantities: on the…
Edge-Minimum Walk of Modular Length in Polynomial Time
Antoine Amarilli, Benoît Groz, Nicole Wein
We study the problem of finding, in a directed graph, an st-walk of length r mod q which is edge-minimum, i.e., uses the smallest number of distinct edges. Despite the vast literat…
Static Analysis of Graph Database Transformations
Iovka Boneva, Benoit Groz, Jan Hidders +2
We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental stat…
Inference of Shape Expression Schemas Typed RDF Graphs
Benoît Groz, Aurélien Lemay, Sławek Staworko +1
We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference,…
A Trichotomy for Regular Simple Path Queries on Graphs
Guillaume Bagan, Angela Bonifati, Benoit Groz
Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investiga…