Scalable Semantic Version Control for Linked Data Management

author: Claudius Hauptmann, TU Munich
published: July 15, 2015,   recorded: June 2015,   views: 1402
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Linked Data is the Semantic Web's established standard for publishing and interlinking data. When authors collaborate on a data set, distribution and tracking of changes are crucial aspects. Several approaches for version control were presented in this area each focusing on different aspects and bounded to different limitations. In this paper we present an approach for semantic version control for dynamic Linked Data based on a delta-based storage strategy and on-demand reconstruction of historic versions. The approach is intended for large data sets and supports targeted and cross-version queries. The approach was implemented prototypically on top of a scalable triple store and tested with a generated data set based on parts of DBpedia with several million triples and thousands of versions.

See Also:

Download slides icon Download slides: eswc2015_hauptmann_linked_data_01.pdf (851.6 KB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: