55 Search Results for "TGDK"

Document/HTML   ×
Document
Preface
Data Management for (Knowledge) Graphs

Authors: Stefania Dumbrava, George Fletcher, Matteo Lissandrini, and Riccardo Tommasini

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
In this Special Issue of Transactions on Graph Data and Knowledge, entitled "Data Management for (Knowledge) Graphs", we present eight articles: one position paper, four research papers, and three resource papers. These span graph data querying, transformation, integration, evolution, and evaluation. Their applications include legislative knowledge management, geospatial data access, and knowledge graph construction from heterogeneous sources with large language models.

Cite as

Stefania Dumbrava, George Fletcher, Matteo Lissandrini, and Riccardo Tommasini. Data Management for (Knowledge) Graphs. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 1:1-1:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{dumbrava_et_al:TGDK.4.2.1,
  author =	{Dumbrava, Stefania and Fletcher, George and Lissandrini, Matteo and Tommasini, Riccardo},
  title =	{{Data Management for (Knowledge) Graphs}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{1:1--1:2},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.1},
  URN =		{urn:nbn:de:0030-drops-275828},
  doi =		{10.4230/TGDK.4.2.1},
  annote =	{Keywords: graph data, property graphs, knowledge graphs, RDF, data management}
}
Document
Position
How Human-Centric Are Our Graph Data Abstractions?

Authors: Angela Bonifati, Anastasia Dimou, Stefania Dumbrava, George Fletcher, Katja Hose, George Konstantinidis, Jose Emilio Labra Gayo, Wim Martens, Nina Pardal, Liat Peterfreund, Katherine Thornton, Maria-Esther Vidal, and Hannes Voigt

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Graph data abstractions are often assumed to be intuitive, but experience shows that they are not equally understandable or usable in practice. In this vision and challenges paper, we examine the human-centricity of contemporary graph data abstractions through four lenses: researchability, usability, teachability, and societal impact. Drawing on diverse real-world use cases, ranging from clinical data and collaborative knowledge bases to biological and pangenomic graphs, we distill insights from database research, human-computer interaction, and education. Based on this analysis, we identify open research challenges that must be addressed to make graph abstractions easier to study, use, learn, and reason about.

Cite as

Angela Bonifati, Anastasia Dimou, Stefania Dumbrava, George Fletcher, Katja Hose, George Konstantinidis, Jose Emilio Labra Gayo, Wim Martens, Nina Pardal, Liat Peterfreund, Katherine Thornton, Maria-Esther Vidal, and Hannes Voigt. How Human-Centric Are Our Graph Data Abstractions?. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 2:1-2:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{bonifati_et_al:TGDK.4.2.2,
  author =	{Bonifati, Angela and Dimou, Anastasia and Dumbrava, Stefania and Fletcher, George and Hose, Katja and Konstantinidis, George and Gayo, Jose Emilio Labra and Martens, Wim and Pardal, Nina and Peterfreund, Liat and Thornton, Katherine and Vidal, Maria-Esther and Voigt, Hannes},
  title =	{{How Human-Centric Are Our Graph Data Abstractions?}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{2:1--2:31},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.2},
  URN =		{urn:nbn:de:0030-drops-275837},
  doi =		{10.4230/TGDK.4.2.2},
  annote =	{Keywords: graph data abstractions, property graphs, RDF, human-centric data management, usability, computing education}
}
Document
Research
Transforming Shape Schemas with Composable Property-Graph Queries

Authors: Philipp Seifer, Daniel Hernández, Ralf Lämmel, and Steffen Staab

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Property graphs may be constrained by schemas that inform both query engines and human users about the shape of valid data, enforcing a contract between data provider and consumer. Composable property-graph queries transform input graphs into output graphs. Then, the question arises of which schema can be expected after one (or several) transformation steps. We investigate how schema constraints can be inferred given an input schema and a transforming query. Specifically, we propose a reasoning procedure that, given an input schema in ProGS and a query in G-CORE infers an output schema. Since graph updates will happen frequently, our inference procedure does not rely on graph instances, such that the computed output schema applies to all graphs originating from any input graph complying with the input schema. Related work has addressed this problem for SPARQL CONSTRUCT queries, encoding it in Description Logics (DLs) so that the output schema is entailed by axioms inferred from input schema and queries. Property graphs and their queries, however, complicate the matter, as property graphs feature label and property annotations as well as first-class edges. Thus, reification has to be used in one way or another, though available DLs lack the means to encode such features directly. We approach this novel challenge via a family of mappings for i) property graphs reified in RDF, aligned with ii) a mapping from ProGS to SHACL and iii) a mapping from G-CORE to SPARQL CONSTRUCT queries. In this manner, schema inference for property graphs becomes manageable, as we break apart the problem through the extra mapping layer and utilize efficient DL reasoners. We develop the metatheory regarding the soundness of inferred schema constraints and the semantic equivalence of mapped schemas and queries.

Cite as

Philipp Seifer, Daniel Hernández, Ralf Lämmel, and Steffen Staab. Transforming Shape Schemas with Composable Property-Graph Queries. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 3:1-3:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{seifer_et_al:TGDK.4.2.3,
  author =	{Seifer, Philipp and Hern\'{a}ndez, Daniel and L\"{a}mmel, Ralf and Staab, Steffen},
  title =	{{Transforming Shape Schemas with Composable Property-Graph Queries}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{3:1--3:29},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.3},
  URN =		{urn:nbn:de:0030-drops-275843},
  doi =		{10.4230/TGDK.4.2.3},
  annote =	{Keywords: Property Graphs, Validation, Schema Inference, Reification, G-CORE, SPARQL}
}
Document
Research
Towards a Theory of Façade-X Data Access: Satisfiability of SPARQL Basic Graph Patterns

Authors: Luigi Asprino and Enrico Daga

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Data integration is the primary use case for knowledge graphs. However, integrated data are not typically graphs but come in different formats, for example, CSV, XML, or a relational database. Façade-X is a recently proposed method for providing direct access to an open-ended set of data formats. The method includes a meta-model that specialises RDF to fit general data structures. This model allows to express SPARQL queries targeting data sources with those structures. Previous work formalised Façade-X and demonstrated how it can theoretically represent any format expressible with a context-free grammar, as well as the relational model. A reference implementation, SPARQL Anything, demonstrates the feasibility of the approach in practice. It is noteworthy that Façade-X utilises a fraction of RDF, and, consequently, not all SPARQL queries yield a solution (i.e. are satisfiable) when evaluated over a Façade-X graph. In this article, we consolidate Façade-X and we study the satisfiability of basic graph patterns. The theory is accompanied by an algorithm for deciding the satisfiability of basic graph patterns on Façade-X data sources. Furthermore, we provide extensive experiments with a proof-of-concept implementation, demonstrating practical feasibility, including with real-world queries. Our results pave the way for studying query execution strategies for Façade-X data access with SPARQL and supporting developers to build more efficient data integration systems for knowledge graphs.

Cite as

Luigi Asprino and Enrico Daga. Towards a Theory of Façade-X Data Access: Satisfiability of SPARQL Basic Graph Patterns. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 5:1-5:46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{asprino_et_al:TGDK.4.2.5,
  author =	{Asprino, Luigi and Daga, Enrico},
  title =	{{Towards a Theory of Fa\c{c}ade-X Data Access: Satisfiability of SPARQL Basic Graph Patterns}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{5:1--5:46},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.5},
  URN =		{urn:nbn:de:0030-drops-275869},
  doi =		{10.4230/TGDK.4.2.5},
  annote =	{Keywords: Fa\c{c}ade-X, RDF, SPARQL, Knowledge Graphs, Data Integration}
}
Document
Research
Multi-Layered Legislative Knowledge Management with Property Graphs

Authors: Andrea Colombo, Francesco Cambria, and Francesco Invernici

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
The sparse nature and intricate set of relationships between legislative acts pose a significant challenge in the choice of the underlying database model, which both allows for performing structured queries and developing intuitive and smooth knowledge management. In this paper, we propose to use Property Graphs as a powerful alternative for managing legislative knowledge. First, we discuss how graph queries are a valid alternative solution to standard legislative knowledge management by showing how our data model fully captures the problem of law versioning (i.e., the existence of many versions for the same law). Then, we analyze, propose and implement innovative ways for monitoring the legislative system using Property Graph tools that have been recently standardized and developed, such as triggers and graph-based association rules, which empower our model of advanced ways of handling legislative data. For instance, we will show how we can use these tools to develop intelligent warning systems that inform stakeholders of critical changes in legislation through active rule reasoning or to detect shifts in graph patterns via continuous monitoring of significant association patterns. Lastly, we will present an approach to expand the Property Graph model to also include laws from an institutional lower layer: regional governments. We then show how this would open new ways to exploit Property Graph tools for legislative knowledge management.

Cite as

Andrea Colombo, Francesco Cambria, and Francesco Invernici. Multi-Layered Legislative Knowledge Management with Property Graphs. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{colombo_et_al:TGDK.4.2.4,
  author =	{Colombo, Andrea and Cambria, Francesco and Invernici, Francesco},
  title =	{{Multi-Layered Legislative Knowledge Management with Property Graphs}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{4:1--4:23},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.4},
  URN =		{urn:nbn:de:0030-drops-275856},
  doi =		{10.4230/TGDK.4.2.4},
  annote =	{Keywords: data management, property graphs, triggers, law}
}
Document
Resource
Logica-TGD: Transforming Graph Databases Logically

Authors: Evgeny Skvortsov, Yilin Xia, Bertram Ludäscher, and Shawn Bowers

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Graph transformations are a powerful computational model for manipulating complex networks, but handling temporal aspects and scalability remain significant challenges. We present a novel approach to implementing graph transformations using Logica, an open-source logic programming language and system that operates over standard database systems including PostgreSQL, DuckDB, and BigQuery. Logica leverages the inherent parallelism of these engines and offers a practical and scalable way to carry out a variety of graph transformations, including complex scenarios such as time-varying graphs. We illustrate Logica’s graph querying and transformation capabilities with several examples, including a declarative program for pathfinding in a dynamic graph and a taxonomic analysis over a full current Wikidata dump. Experimental results compare Logica running on DuckDB engine to the Datalog engines Soufflé and Nemo, and to DuckPGQ, an implementation of SQL/PGQ. We argue that a logic-based declarative syntax, a built-in visualization library, and (plug-and-play) support for large-scale database engines make Logica a convenient and practical tool for a wide range of graph transformation tasks.

Cite as

Evgeny Skvortsov, Yilin Xia, Bertram Ludäscher, and Shawn Bowers. Logica-TGD: Transforming Graph Databases Logically. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 7:1-7:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{skvortsov_et_al:TGDK.4.2.7,
  author =	{Skvortsov, Evgeny and Xia, Yilin and Lud\"{a}scher, Bertram and Bowers, Shawn},
  title =	{{Logica-TGD: Transforming Graph Databases Logically}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{7:1--7:27},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.7},
  URN =		{urn:nbn:de:0030-drops-275889},
  doi =		{10.4230/TGDK.4.2.7},
  annote =	{Keywords: Logic rules, Graph queries, Graph transformations}
}
Document
Research
OM4OV: Leveraging Ontology Matching for Ontology Versioning

Authors: Zhangcheng Qiang, Kerry Taylor, and Weiqing Wang

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Due to the dynamics of the Semantic Web, version control is necessary to manage changes in widely used ontologies. Despite the long-standing recognition of ontology versioning (OV) as a crucial component of efficient ontology management, many approaches treat OV as similar to ontology matching (OM) and directly reuse OM systems for OV tasks. In this study, we systematically analyse similarities and differences between OM and OV and formalise an OM4OV framework to offer more advanced OV support. The framework is implemented and evaluated in the state-of-the-art OM system Agent-OM. The experimental results indicate that OM systems can be effectively reused for OV tasks, but without the necessary extensions, can produce skewed measurements, poor performance in detecting update entities, and limited explanations of false mappings. To tackle these issues, we propose an optimisation method called the cross-reference (CR) mechanism, which builds on existing OM alignments to reduce the number of matching candidates and to improve overall OV performance.

Cite as

Zhangcheng Qiang, Kerry Taylor, and Weiqing Wang. OM4OV: Leveraging Ontology Matching for Ontology Versioning. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{qiang_et_al:TGDK.4.2.6,
  author =	{Qiang, Zhangcheng and Taylor, Kerry and Wang, Weiqing},
  title =	{{OM4OV: Leveraging Ontology Matching for Ontology Versioning}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{6:1--6:19},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.6},
  URN =		{urn:nbn:de:0030-drops-275876},
  doi =		{10.4230/TGDK.4.2.6},
  annote =	{Keywords: ontology matching, ontology versioning}
}
Document
Resource
GeoSPARQL and SPARQL Benchmarking with GeoRDFBench Framework

Authors: Theofilos Ioannidis, Nikos Mamoulis, and Manolis Koubarakis

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
We present the GeoRDFBench framework, whose purpose is to assist and streamline the benchmarking of geospatial semantic stores. We identify and formally define all benchmark components, extend them to represent their geospatial aspects, allow for the automatic mapping of datasets to graphs, provide a specialization hierarchy of queryset types for micro or macro experimental scenarios, even for modeling dynamically generated queries. Queries may define their expected resultset to enable automatic accuracy verification. Experiment behavior and execution logic is controlled by the execution specification, which dictates the action (run experiment or print ground queries) to take, the number of repetitions per execution type (cold, warm, continuous cold), the query repetition and experiment timeouts, the delay period before clearing caches, the aggregating function for reporting execution times, and the policy to follow upon cold execution time out. We decouple these declarative benchmark specifications from the framework’s execution engine and serialize them as JSON files; this way, we increase their reuse (instantiation through deserialization), experiment reproducibility and dissemination. Furthermore, these JSON specification libraries can be served remotely by a configurable REST API endpoint. We also model the Geospatial RDF store optional application and database server modules and manage their life-cycle (start, stop, restart) during experiment execution to achieve ideal cold cache query executions. In addition, we unify by generalization the repository and connection functionalities of the three most common RDF framework Java APIs offered by RDF stores: OpenRDF Sesame, Eclipse RDF4J and Apache Jena. At the same time GeoRDFBench allows queryset filtering, automatic system-dependent query namespace prefix generation and query rewriting when non GeoSPARQL spatial vocabularies are used. We provide for a quick learning start by implementing several geospatial RDF stores as separate runtime-dependent modules with repository generation and experiment execution scripts. RDF modules include: RDF4J with and without Lucene, GraphDB, Stardog, Strabon, OpenLink Virtuoso and Jena GeoSPARQL.

Cite as

Theofilos Ioannidis, Nikos Mamoulis, and Manolis Koubarakis. GeoSPARQL and SPARQL Benchmarking with GeoRDFBench Framework. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 8:1-8:50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{ioannidis_et_al:TGDK.4.2.8,
  author =	{Ioannidis, Theofilos and Mamoulis, Nikos and Koubarakis, Manolis},
  title =	{{GeoSPARQL and SPARQL Benchmarking with GeoRDFBench Framework}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{8:1--8:50},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.8},
  URN =		{urn:nbn:de:0030-drops-275896},
  doi =		{10.4230/TGDK.4.2.8},
  annote =	{Keywords: geospatial, semantic, benchmarking, framework}
}
Document
Resource
BLINKG: A Benchmark for LLM-Integrated Knowledge Graph Generation

Authors: Carla Castedo, Enrique Iglesias, Manuel Lama, Alberto Bugarín-Diz, Maria-Esther Vidal, and David Chaves-Fraga

Published in: TGDK, Volume 4, Issue 2 (2026): Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge, Volume 4, Issue 2


Abstract
Generating Knowledge Graphs (KGs) remains one of the most time-consuming and labor-intensive tasks for knowledge engineers, as they need to identify semantic equivalences between input data sources and ontology terms. While declarative solutions (e.g., RML, SPARQL-Anything) have helped to generalize this process, aligning input schema elements with ontology terms still involves intricate transformations and requires considerable manual effort. With the advent of Large Language Models (LLMs), there is growing interest in leveraging their capabilities to assist KG engineers. Although some studies have explored using LLMs to automate KG construction, there is still no standardized framework for assessing how effectively they establish correspondences between data schemes and ontology concepts. Therefore, in this paper, we propose BLINKG, a benchmark designed to evaluate the mapping capabilities of LLMs in constructing KGs from heterogeneous data sources. The benchmark includes a set of scenarios with increasing complexity, based on real-world use cases. We conduct an extensive experimental evaluation of several state-of-the-art LLMs using BLINK and observe that they already offer promising solutions. However, their performance remains limited in complex scenarios. Thanks to this benchmark we can already asses the current capabilities of LLMs for KG construction. Additionally, we define a set of requirements for achieving (semi)automated (LLM-driven) KG construction, opening new research lines in this area.

Cite as

Carla Castedo, Enrique Iglesias, Manuel Lama, Alberto Bugarín-Diz, Maria-Esther Vidal, and David Chaves-Fraga. BLINKG: A Benchmark for LLM-Integrated Knowledge Graph Generation. In Special Issue on Data Management for (Knowledge) Graphs. Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 2, pp. 9:1-9:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{castedo_et_al:TGDK.4.2.9,
  author =	{Castedo, Carla and Iglesias, Enrique and Lama, Manuel and Bugar{\'\i}n-Diz, Alberto and Vidal, Maria-Esther and Chaves-Fraga, David},
  title =	{{BLINKG: A Benchmark for LLM-Integrated Knowledge Graph Generation}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{9:1--9:35},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{2},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.2.9},
  URN =		{urn:nbn:de:0030-drops-275901},
  doi =		{10.4230/TGDK.4.2.9},
  annote =	{Keywords: Knowledge Graph Construction, Benchmarking, Mapping Languages, Large Language Models}
}
Document
Research
Native Provenance Computation for Federated and Non-Federated SPARQL Queries

Authors: Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1


Abstract
The popularity of knowledge graphs (KGs) owes credit to their flexible data model, which is suitable for data integration from multiple sources. Several KG-based applications, such as trust assessment, view maintenance, or data valuation on dynamic data, rely on the ability to compute provenance explanations for query results. This need becomes more urgent in federated query processing systems, which allow the online consumption of heterogeneous and decentralized Web data. However, the problem of computing and interacting with provenance has received little attention, especially in the federated setting. On those grounds, this paper introduces the NPCS (Native Provenance Computation for SPARQL) approach, and its federated variant Fed-NPCS, that compute provenance for SPARQL query results. Both approaches build upon spm-semirings to annotate the results of monotonic and non-monotonic SPARQL queries with their provenance. Due to their reliance on query rewriting techniques, the approaches are directly applicable to already deployed SPARQL engines and federations using different reification schemes, including RDF-star. Our experimental evaluation shows that our novel query rewriting approach brings significant run-time improvements w.r.t. the state-of-the-art across both centralized and federated settings. In centralized settings, our tests on two popular SPARQL engines (GraphDB and Stardog) reveal substantial runtime gains over existing query rewriting solutions, enabling scalability to RDF graphs with billions of triples. In federated settings, our experiments on the FedShop benchmark with GraphDB show the viability of Fed-NPCS for federations with up to 200 sources.

Cite as

Zubaria Asma, Daniel Hernández, Luis Galárraga, Giorgos Flouris, Irini Fundulaki, and Katja Hose. Native Provenance Computation for Federated and Non-Federated SPARQL Queries. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 4:1-4:43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{asma_et_al:TGDK.4.1.4,
  author =	{Asma, Zubaria and Hern\'{a}ndez, Daniel and Gal\'{a}rraga, Luis and Flouris, Giorgos and Fundulaki, Irini and Hose, Katja},
  title =	{{Native Provenance Computation for Federated and Non-Federated SPARQL Queries}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{4:1--4:43},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.4},
  URN =		{urn:nbn:de:0030-drops-259642},
  doi =		{10.4230/TGDK.4.1.4},
  annote =	{Keywords: native provenance computation, federated SPARQL queries, data provenance, NPCS, Fed-NPCS}
}
Document
Survey
Temporal Modelling in Cultural Heritage Knowledge Graphs: Use Cases, Requirements, Evaluation, and Decision Support

Authors: Oleksandra Bruns, Jörg Waitelonis, Jeff Z. Pan, and Harald Sack

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1


Abstract
Our culture, history and world are in constant motion, continuously shaped by the flow of time, evolving narratives, and shifting relationships. Capturing this temporal complexity within cultural heritage (CH) knowledge graphs is essential for preserving the dynamic nature of human heritage. However, standard RDF predicates fail to effectively model the temporal aspects of cultural data, such as changing facts, evolving relationships, and temporal concepts. Over the past two decades, a variety of RDF-based approaches have been proposed to address this limitation, yet guidance is missing on which method best suits specific CH contexts. This paper presents a systematic evaluation of temporal RDF modelling approaches from a CH perspective. Based on an analysis of real-world CH use cases, core temporal requirements are identified that reflect both modelling expressivity and practical concerns. Six prominent approaches - RDF*, tRDF, Named Graphs, Singleton Property, N-ary Relations, and 4D Fluents - are assessed across these requirements. Our findings reveal that no single solution fits all scenarios, but suitable approaches can be selected based on project-specific priorities. To support practitioners, a decision-support tool is introduced to guide them in selecting the most suitable extension for their specific needs. This work provides practical guidance for CH modelling and contributes to the broader development of temporally aware Linked Data.

Cite as

Oleksandra Bruns, Jörg Waitelonis, Jeff Z. Pan, and Harald Sack. Temporal Modelling in Cultural Heritage Knowledge Graphs: Use Cases, Requirements, Evaluation, and Decision Support. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 2:1-2:46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{bruns_et_al:TGDK.4.1.2,
  author =	{Bruns, Oleksandra and Waitelonis, J\"{o}rg and Pan, Jeff Z. and Sack, Harald},
  title =	{{Temporal Modelling in Cultural Heritage Knowledge Graphs: Use Cases, Requirements, Evaluation, and Decision Support}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{2:1--2:46},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.2},
  URN =		{urn:nbn:de:0030-drops-256871},
  doi =		{10.4230/TGDK.4.1.2},
  annote =	{Keywords: Temporal Data Representation, RDF Extensions, Cultural Heritage, Knowledge Graphs}
}
Document
Research
Semantically Reflected Programs

Authors: Eduard Kamburjan, Vidar Norstein Klungre, Yuanwei Qu, Rudolf Schlatte, Egor V. Kostylev, Martin Giese, and Einar Broch Johnsen

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1


Abstract
This paper addresses the dichotomy between the formalization of structural and the formalization of executable behavioral knowledge by means of semantically lifted programs, which explore an intuitive connection between imperative programs and knowledge graphs. While knowledge graphs and ontologies are eminently useful to represent formal knowledge about a system’s individuals and universals, programming languages are designed to describe the system’s evolution. To address this dichotomy, we introduce a semantic lifting of the program states of an executing progam into a knowledge graph, for an object-oriented programming language. The resulting graph is exposed as a semantic reflection layer within the programming language, allowing programmers to leverage knowledge of the application domain in their programs during execution. In this paper, we formalize semantic lifting and semantic reflection for a small imperative programming language, SMOL, explain the operational aspects of the language, and consider type correctness and virtualization for runtime program queries through the semantic reflection layer. We illustrate semantic lifting and semantic reflection through a case study of geological modeling and discuss different applications of the technique. The language implementation is open source and available online.

Cite as

Eduard Kamburjan, Vidar Norstein Klungre, Yuanwei Qu, Rudolf Schlatte, Egor V. Kostylev, Martin Giese, and Einar Broch Johnsen. Semantically Reflected Programs. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 3:1-3:52, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{kamburjan_et_al:TGDK.4.1.3,
  author =	{Kamburjan, Eduard and Klungre, Vidar Norstein and Qu, Yuanwei and Schlatte, Rudolf and Kostylev, Egor V. and Giese, Martin and Johnsen, Einar Broch},
  title =	{{Semantically Reflected Programs}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{3:1--3:52},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.3},
  URN =		{urn:nbn:de:0030-drops-256884},
  doi =		{10.4230/TGDK.4.1.3},
  annote =	{Keywords: Knowledge Graphs, Ontologies, Object-Oriented Modelling, Imperative Programming Languages, Reflection, Type Safety}
}
Document
Research
On the Computational Cost of Knowledge Graph Embeddings

Authors: Victor Charpenay, Mansour Zoubeirou A Mayaki, and Antoine Zimmermann

Published in: TGDK, Volume 4, Issue 1 (2026). Transactions on Graph Data and Knowledge, Volume 4, Issue 1


Abstract
Over a decade, numerous Knowledge Graph Embedding (KGE) models have been designed and evaluated on reference datasets, always with increasing performance. In this paper, we re-evaluate these models with respect to their computational efficiency during training, by estimating the computational cost of the procedure expressed in floating-point operations. We design a cost model based on analytical expressions and apply it on a collection of 20 KGE models, representative of the state-of-the-art. We show that dimensionality or parameter efficiency, used in the literature to compare models with each other, are not suitable to evaluate the true cost of models. Through fixed-budget experiments, a novel approach to evaluate KGE models based on cost estimates, we re-assess the relative performance of model families compared to the state-of-the-art. Bilinear models such as ComplEx underperform with a low computational budget while hyperbolic linear models appear to offer no particular benefit compared to simpler Euclidian models, especially the MuRE model. Neural models, such as ConvE or CompGCN, achieve reasonable performance in the literature but their high computational cost appears unnecessary when compared with other models. The trade-off between efficiency and expressivity of both linear and neural models is to be further explored.

Cite as

Victor Charpenay, Mansour Zoubeirou A Mayaki, and Antoine Zimmermann. On the Computational Cost of Knowledge Graph Embeddings. In Transactions on Graph Data and Knowledge (TGDK), Volume 4, Issue 1, pp. 1:1-1:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@Article{charpenay_et_al:TGDK.4.1.1,
  author =	{Charpenay, Victor and Zoubeirou A Mayaki, Mansour and Zimmermann, Antoine},
  title =	{{On the Computational Cost of Knowledge Graph Embeddings}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{1:1--1:30},
  ISSN =	{2942-7517},
  year =	{2026},
  volume =	{4},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.4.1.1},
  URN =		{urn:nbn:de:0030-drops-256863},
  doi =		{10.4230/TGDK.4.1.1},
  annote =	{Keywords: Knowledge Graph Embedding, Parameter Efficiency, Computational Budget, Green AI}
}
Document
Research
A Logic Programming Approach to Repairing SHACL Constraint Violations

Authors: Shqiponja Ahmetaj, Robert David, Axel Polleres, and Mantas Šimkus

Published in: TGDK, Volume 3, Issue 3 (2025). Transactions on Graph Data and Knowledge, Volume 3, Issue 3


Abstract
The Shapes Constraint Language (SHACL) is a recent standard, a W3C recommendation, for validating RDF graphs against shape constraints to be checked on target nodes of a data graph. The standard also describes the notion of validation reports, which detail the results of the validation process. In case of violation of constraints, the validation report should explain the reasons for non-validation, offering guidance on how to identify or fix violations in the data graph. Since the specification left it open to SHACL processors to define such explanations, a recent work proposed the use of explanations in the style of database repairs, where a repair is a set of additions to or deletions from the data graph so that the resulting graph validates against the constraints. In this paper, we study such repairs for non-recursive SHACL, the largest fragment of SHACL that is fully defined in the specification. We propose an algorithm to compute repairs by encoding the explanation problem - using Answer Set Programming (ASP) - into a logic program, where the answer sets contain (minimal) repairs. We then study a scenario where it is not possible to simultaneously repair all the targets, which may be the case due to overall unsatisfiability or conflicting constraints. We introduce a relaxed notion of validation, which allows to validate a (maximal) subset of the targets and adapt the ASP translation to take into account this relaxation. Finally, we add support for repairing constraints which use property paths and equality of paths. Our implementation in clingo is - to the best of our knowledge - the first implementation of a repair program for SHACL.

Cite as

Shqiponja Ahmetaj, Robert David, Axel Polleres, and Mantas Šimkus. A Logic Programming Approach to Repairing SHACL Constraint Violations. In Transactions on Graph Data and Knowledge (TGDK), Volume 3, Issue 3, pp. 1:1-1:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)


Copy BibTex To Clipboard

@Article{ahmetaj_et_al:TGDK.3.3.1,
  author =	{Ahmetaj, Shqiponja and David, Robert and Polleres, Axel and \v{S}imkus, Mantas},
  title =	{{A Logic Programming Approach to Repairing SHACL Constraint Violations}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{1:1--1:36},
  ISSN =	{2942-7517},
  year =	{2025},
  volume =	{3},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.3.3.1},
  URN =		{urn:nbn:de:0030-drops-252124},
  doi =		{10.4230/TGDK.3.3.1},
  annote =	{Keywords: SHACL, Shapes Constraint Language, Database Repairs, Knowledge Graphs, Semantic Web, Answer Set Programming}
}
Document
Use Case
Automating Invoice Validation with Knowledge Graphs: Optimizations and Practical Lessons

Authors: Johannes Mäkelburg and Maribel Acosta

Published in: TGDK, Volume 3, Issue 3 (2025). Transactions on Graph Data and Knowledge, Volume 3, Issue 3


Abstract
To increase the efficiency of creating, distributing, and processing of invoices, invoicing is handled in the form of Electronic Data Interchange (EDI). With EDI, invoices are handled in a standardized electronic or digital format rather than on paper. While EDIFACT is widely used for electronic invoicing, there is no standardized approach for validating its content. In this work, we tackle the problem of automatically validating electronic invoices in the EDIFACT format by leveraging KG technologies. We build on a previously developed pipeline that transforms EDIFACT invoices into RDF knowledge graphs (KGs). The resulting graphs are validated using SHACL constraints defined in collaboration with domain experts. In this work, we improve the pipeline by enhancing the correctness of the invoice representation, reducing validation time, and introducing error prioritization through the use of the severity predicate in SHACL. These improvements make validation results easier to interpret and significantly reduce the manual effort required. Our evaluation confirms that the approach is correct, efficient, and practical for real-world use.

Cite as

Johannes Mäkelburg and Maribel Acosta. Automating Invoice Validation with Knowledge Graphs: Optimizations and Practical Lessons. In Transactions on Graph Data and Knowledge (TGDK), Volume 3, Issue 3, pp. 2:1-2:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)


Copy BibTex To Clipboard

@Article{makelburg_et_al:TGDK.3.3.2,
  author =	{M\"{a}kelburg, Johannes and Acosta, Maribel},
  title =	{{Automating Invoice Validation with Knowledge Graphs: Optimizations and Practical Lessons}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{2:1--2:24},
  ISSN =	{2942-7517},
  year =	{2025},
  volume =	{3},
  number =	{3},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.3.3.2},
  URN =		{urn:nbn:de:0030-drops-252137},
  doi =		{10.4230/TGDK.3.3.2},
  annote =	{Keywords: Electronic Invoice, Ontology, EDIFACT, RDF, RML, SHACL}
}
  • Refine by Type
  • Document/HTML
  • 55 Document/PDF

  • Refine by Publication Year
  • 13 2026
  • 12 2025
  • 16 2024
  • 14 2023

  • Refine by Author
  • 4 Dumbrava, Stefania
  • 4 Hose, Katja
  • 4 Lissandrini, Matteo
  • 4 Vidal, Maria-Esther
  • 3 Biswas, Russa
  • Show More...

  • Refine by Series/Journal
  • 54 TGDK
  • 1 DagRep

  • Refine by Classification
  • 16 Computing methodologies → Knowledge representation and reasoning
  • 14 Information systems → Graph-based database models
  • 8 Computing methodologies → Ontology engineering
  • 8 Information systems → Semantic web description languages
  • 6 Computing methodologies → Semantic networks
  • Show More...

  • Refine by Keyword
  • 10 Knowledge Graphs
  • 6 RDF
  • 4 Knowledge graphs
  • 4 Large Language Models
  • 4 OWL
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail