Exposing RDF Archives using Triple Pattern Fragments
Linked Datasets typically change over time, and knowledge of this historical information can be useful. This makes the storage and querying of Dynamic Linked Open Data an important area of research. With the current versioning solutions, publishing Dynamic Linked Open Data at Web-Scale is possible, but too expensive. We investigate the possibility of using the low-cost Triple Pattern Fragments (TPF) interface to publish versioned Linked Open Data. In this paper, we discuss requirements for supporting versioning in the TPF framework, on the level of the interface, storage and client, and investigate which trade-offs exist. These requirements lay the foundations for further research in the area of low-cost, Web-Scale dynamic Linked Open Data publication and querying.
Published in 2017 in Proceedings of the 20th International Conference on Knowledge Engineering and Knowledge Management: Satellite Events.
Keywords: Linked Data, Triple Pattern Fragments, Web, research
Read this paper online
Cite this paper in your publications
- Use the BibTeX entry to easily refer to this paper.
- Alternatively, you can refer to this paper as: Taelman, R., Verborgh, R. and Mannens, E. (2017), “Exposing RDF Archives using Triple Pattern Fragments”, in Proceedings of the 20th International Conference on Knowledge Engineering and Knowledge Management: Satellite Events, Vol. 10180, Lecture Notes in Computer Science, Springer.