Time travel for knowledge graphs: live queries over RDF change histories
Pith reviewed 2026-05-24 11:04 UTC · model grok-4.3
The pith
The Time Agnostic Library enables live execution of all six temporal SPARQL query types on any SPARQL-compliant triplestore using the OpenCitations Data Model for provenance.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The Time Agnostic Library supports version materialization, single-version and cross-version structured queries, delta materialization, and single-delta and cross-delta structured queries over multi-triple patterns, with sub-linear scaling in execution time and memory on the BEAR-B benchmark, and is faster than R43ples across all query types while allowing concurrent updates.
Load-bearing premise
The data is stored according to the OpenCitations Data Model using PROV-O and SPARQL UPDATE operations to record provenance, which is required for the library to reconstruct temporal information without additional indexing.
read the original abstract
Performing time-traversal queries on RDF datasets remains unsupported in the most extensive knowledge graphs. Existing solutions either require offline ingestion, which prevents concurrent querying and updating, or operate live but with limited query coverage or triplestore dependency. This article presents the Time Agnostic Library, a Python library for performing temporal SPARQL queries live on any SPARQL-compliant triplestore, supporting all six temporal retrieval needs identified in the literature and concurrent updates. The methodology builds on the OpenCitations Data Model (OCDM), which records provenance using the Provenance Ontology (PROV-O) and SPARQL UPDATE operations. The library supports version materialization, single-version and cross-version structured queries, delta materialization, and single-delta and cross-delta structured queries over multi-triple patterns. Evaluation on the BEAR-B benchmark shows sub-linear scaling in both execution time and memory consumption as the number of versions increases. While preprocessing-based systems such as OSTRICH achieve faster query times, they require offline ingestion and cannot handle concurrent data updates. Against R43ples, the closest live system in architecture, the Time Agnostic Library is faster across all query types.
Editorial analysis
A structured set of objections, weighed in public.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Any SPARQL-compliant triplestore supports the necessary UPDATE operations and can be queried for provenance data recorded in PROV-O.
Forward citations
Cited by 1 Pith paper
-
HERITRACE: a domain-agnostic framework for SHACL-driven RDF curation with provenance and change tracking
HERITRACE is a domain-agnostic framework for SHACL-driven RDF curation with automatic provenance and change tracking.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.