DBMar 20

Condensed Representation for Snapshot-Based RDF Graphs

arXiv:2506.212037.71 citationsh-index: 2
Predicted impact top 70% in DB · last 90 daysOriginality Incremental advance
AI Analysis

This work addresses the challenge of organizing and accessing constantly evolving data in knowledge graph management systems, which is incremental as it builds on prior methods for snapshot-based RDF graphs.

The paper tackles the problem of managing evolving knowledge graphs by proposing a condensed representation and a new solution called QuaQue for querying across multiple graph versions, with benchmark results showing improved performance compared to existing approaches.

Evolving phenomena, often complex, can be represented using knowledge graphs, which have the capability to model heterogeneous data from multiple sources. Nowadays, a considerable amount of sources delivering periodic updates to knowledge graphs in various domains is openly available. The evolution of data is of interest to knowledge graph management systems, and therefore it is crucial to organize these constantly evolving data to make them easily accessible and exploitable for analysis. In this article, we will present and formalize the condensed representation of these evolving graphs and propose a new solution called QuaQue that allows querying across multiple versions of graphs and we also present the results of our benchmark comparing our solution against existing approaches.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes