activity
20112026
most citedQuerying Best Paths in Graph Databases

1 citations · 3 across the 7 of their papers we have counts for

collaborators

8 papers

cs.DB2026

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…

cs.DB2025

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…

cs.DB2021

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,…

cs.LO2020

Modular Path Queries with Arithmetic

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive featu…

cs.LO2018

Containment of Shape Expression Schemas for RDF

Slawek Staworko, Piotr Wieczorek

We study the problem of containment for shape expression schemas (ShEx) for RDF graphs. We identify a subclass of ShEx that has a natural graphical representation in the form of sh…

cs.DB2017★ 1 cited

Querying Best Paths in Graph Databases

Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and c…

cs.DB2012★ 1 cited

On Injective Embeddings of Tree Patterns

Jakub Michaliszyn, Anca Muscholl, Sławek Staworko +2

We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embed…

cs.DB2011★ 1 cited

Learning XML Twig Queries

Sławomir Staworko, Piotr Wieczorek

We investigate the problem of learning XML queries, path queries and tree pattern queries, from examples given by the user. A learning algorithm takes on the input a set of XML doc…