On the Implementations of the BiTemporal RDF Model: An Experimental Approach

The BiTemporal RDF (BiTRDF) model extends the standard RDF data model by integrating both valid time and transaction time, thus enabling the representation and querying of dynamic and historical knowledge. While the theoretical foundations of BiTRDF have been established, practical implementation strategies have not yet been systematically studied. This paper bridges this gap by exploring six alternative approaches to implementing BiTRDF, combining object-oriented programming and database-oriented designs using Python and PostgreSQL. We evaluate these approaches using six synthetic datasets ranging from 0.5 million to 16 million bitemporal triples. The evaluation focuses on memory consumption, data-loading time, and query performance as data load increases. The results show that all approaches perform comparably when the knowledge store fits in memory. As the dataset size grows beyond available RAM, database-oriented implementations achieve substantially better loading and query performance, while object-oriented implementations offer greater flexibility and extensibility. These findings demonstrate the feasibility of implementing BiTRDF using existing technologies and provide practical guidance for selecting appropriate implementation strategies based on data size, performance requirements, and extensibility needs.

Authors

Institutions

Publication Details

Journal
Informatics
Published
2026-04-15
DOI
https://doi.org/10.3390/informatics13040061
Primary Topic
Semantic Web and Ontologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Implementations of the BiTemporal RDF Model: An Experimental Approach

Hsien-Tseng Wang, Abdullah Uz Tansel, Di Wu
Informatics
Semantic Web and Ontologies
article

On the Implementations of the BiTemporal RDF Model: An Experimental Approach

Hsien-Tseng Wang, Abdullah Uz Tansel, Di Wu
article en

Abstract

The BiTemporal RDF (BiTRDF) model extends the standard RDF data model by integrating both valid time and transaction time, thus enabling the representation and querying of dynamic and historical knowledge. While the theoretical foundations of BiTRDF have been established, practical implementation strategies have not yet been systematically studied. This paper bridges this gap by exploring six alternative approaches to implementing BiTRDF, combining object-oriented programming and database-oriented designs using Python and PostgreSQL. We evaluate these approaches using six synthetic datasets ranging from 0.5 million to 16 million bitemporal triples. The evaluation focuses on memory consumption, data-loading time, and query performance as data load increases. The results show that all approaches perform comparably when the knowledge store fits in memory. As the dataset size grows beyond available RAM, database-oriented implementations achieve substantially better loading and query performance, while object-oriented implementations offer greater flexibility and extensibility. These findings demonstrate the feasibility of implementing BiTRDF using existing technologies and provide practical guidance for selecting appropriate implementation strategies based on data size, performance requirements, and extensibility needs.

InformaticsVol. 13(4)
Baruch College (US), Lehman College (US), City University of New York (US)
Openalex Percentile: Top 22%
Semantic Web and Ontologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.