activity
20052026
most citedThe Future is Big Graphs! A Community View on Graph Processing Systems

157 citations · 282 across the 17 of their papers we have counts for

collaborators

17 papers

cs.DB2026

sheval: An RDF data shapes evaluation tool and test-suite for recursive shapes

Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders +8

Two different languages have been developed to validate RDF data based on the concept of a shape: ShEx and SHACL. In each language it is possible to define a shape that refers to i…

cs.LO2026

Common Foundations for Recursive Shape Languages

Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders +9

As schema languages for RDF data become more mature, we are seeing efforts to extend them with recursive semantics, applying diverse ideas from logic programming and description lo…

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.DB2025★ 5 cited

Common Foundations for SHACL, ShEx, and PG-Schema

S. Ahmetaj, I. Boneva, J. Hidders +11

Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks,…

cs.DB2023

The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space

Gábor Szárnyas, Brad Bebee, Altan Birler +30

Graph data management is instrumental for several use cases such as recommendation, root cause analysis, financial fraud detection, and enterprise knowledge representation. Efficie…

cs.DB2023★ 1 cited

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…

cs.DB2022★ 77 cited

PG-Schema: Schemas for Property Graphs

Renzo Angles, Angela Bonifati, Stefania Dumbrava +18

Property graphs have reached a high level of maturity, witnessed by multiple robust graph database systems as well as the ongoing ISO standardization effort aiming at creating a ne…

cs.DB2022

Expressiveness within Sequence Datalog

Heba Aamer, Jan Hidders, Jan Paredaens +1

Motivated by old and new applications, we investigate Datalog as a language for sequence databases. We reconsider classical features of Datalog programs, such as negation, recursio…

cs.DB2021

Threshold Queries in Theory and in the Wild

Angela Bonifati, Stefania Dumbrava, George Fletcher +7

Threshold queries are an important class of queries that only require computing or counting answers up to a specified threshold value. To the best of our knowledge, threshold queri…

cs.DC2020★ 157 cited

The Future is Big Graphs! A Community View on Graph Processing Systems

Sherif Sakr, Angela Bonifati, Hannes Voigt +38

Graphs are by nature unifying abstractions that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users a…

cs.DB2020★ 2 cited

J-Logic: a Logic for Querying JSON

Jan Hidders, Jan Paredaens, Jan Van den Bussche

We propose a logical framework, based on Datalog, to study the foundations of querying JSON data. The main feature of our approach, which we call J-Logic, is the emphasis on paths.…

cs.LO2017

Finding AND-OR Hierarchies in Workflow Nets

Jacek Sroka, Jan Hidders

This paper presents the notion of AND-OR reduction, which reduces a WF net to a smaller net by iteratively contracting certain well-formed subnets into single nodes until no more s…

cs.DB2012★ 2 cited

External memory bisimulation reduction of big graphs

Yongming Luo, George H. L. Fletcher, Jan Hidders +2

In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintena…

cs.FL2012

On Generating *-Sound Nets with Substitution

Jacek Sroka, Jan Hidders

We present a method for hierarchically generating sound workflow nets by substitution of nets with multiple inputs and outputs. We show that this method is correct and generalizes…

cs.DB2011★ 38 cited

SERIMI - Resource Description Similarity, RDF Instance Matching and Interlinking

Samur Araujo, Jan Hidders, Daniel Schwabe +1

The interlinking of datasets published in the Linked Data Cloud is a challenging problem and a key factor for the success of the Semantic Web. Manual rule-based methods are the mos…

cs.DB2005

Instance-Independent View Serializability for Semistructured Databases

Stijn Dekeyser, Jan Hidders, Jan Paredaens +1

Semistructured databases require tailor-made concurrency control mechanisms since traditional solutions for the relational model have been shown to be inadequate. Such mechanisms n…