Jan Hidders
YOU?
Author Swipe
View article: The KG-ER Conceptual Schema Language
The KG-ER Conceptual Schema Language Open
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, property graphs, RDF) while helping to capture the semantics …
View article: Expressiveness within Sequence Datalog
Expressiveness within Sequence Datalog Open
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, recursion, intermediate predicates, and relations of higher arities…
View article: Common Foundations for SHACL, ShEx, and PG-Schema
Common Foundations for SHACL, ShEx, and PG-Schema Open
Graphs have emerged as an important foundation for a variety of applications, including capturing and reasoning over factual knowledge, semantic data integration, social networks, and providing factual knowledge for machine learning algori…
View article: The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space
The Linked Data Benchmark Council (LDBC): Driving competition and collaboration in the graph data management space Open
Graph data management is instrumental for several use cases such as recommendation, root cause analysis, financial fraud detection, and enterprise knowledge representation. Efficiently supporting these use cases yields a number of unique r…
View article: Static Analysis of Graph Database Transformations
Static Analysis of Graph Database Transformations Open
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 static analysis problems: type checking and equivalence of tran…
View article: PG-Schema: Schemas for Property Graphs
PG-Schema: Schemas for Property Graphs Open
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 new standard Graph Query Language (GQL). Yet, despite documen…
View article: Threshold Queries
Threshold Queries Open
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 queries have been largely disregarded in the research literature…
View article: Static Analysis of Graph Database Transformations
Static Analysis of Graph Database Transformations Open
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 static analysis problems: type checking and equivalence of tran…
View article: PG-Schema: Schemas for Property Graphs
PG-Schema: Schemas for Property Graphs Open
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 new standard Graph Query Language (GQL). Yet, despite documen…
View article: Expressiveness within Sequence Datalog
Expressiveness within Sequence Datalog Open
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, recursion, intermediate predicates, and relations of higher arities…
View article: Threshold queries in theory and in the wild
Threshold queries in theory and in the wild Open
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 queries have been largely disregarded in the research literature…
View article: The future is big graphs
The future is big graphs Open
Ensuring the success of big graph processing for the next decade and beyond.
View article: Threshold Queries in Theory and in the Wild
Threshold Queries in Theory and in the Wild Open
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 queries have been largely disregarded in the research literature…
View article: PG-Keys: Keys for Property Graphs
PG-Keys: Keys for Property Graphs Open
International audience
View article: The Future is Big Graphs! A Community View on Graph Processing Systems
The Future is Big Graphs! A Community View on Graph Processing Systems Open
Graphs are by nature unifying abstractions that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users and consumers of graph instances and graph workloads underst…
View article: J-Logic: a Logic for Querying JSON
J-Logic: a Logic for Querying JSON Open
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. Paths are sequences of keys and are used to access the tre…
View article: Defining Schemas for Property Graphs by using the GraphQL Schema Definition Language
Defining Schemas for Property Graphs by using the GraphQL Schema Definition Language Open
GraphQL is a highly popular new approach to build Web APIs. An important component of this approach is the GraphQL schema definition language (SDL). The original purpose of this language is to define a so-called GraphQL schema that specifi…
View article: Finding AND-OR Hierarchies in Workflow Nets
Finding AND-OR Hierarchies in Workflow Nets Open
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 such contractions are possible. This reduction can reveal th…
View article: On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality
On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality Open
International audience