A verified algebra for read-write linked data
A verified algebra for read-write linked data
The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data refers to a collection of standards which aim to enhance the world’s data, by interlinking datasets through the Web. The starting point is as simple as using URIs as global identifiers in data, but the technical challenges of managing data in this distributed setting are immense. An algebra is an essential contribution to this application domain. To verify the algebra several useful things are established. A high level language is defined that concisely captures query and update languages for Linked Data. The language is provided with a concise operational semantics. The natural notions of equivalence, contextual equivalence, is shown to coincide with the bisimulation proof technique. Ultimately, bisimulation allows the algebra proven to be correct. Some novel techniques are used in establishing these results.
linked data, sparql
1-30
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Horne, Ross and Sassone, Vladimiro
(2012)
A verified algebra for read-write linked data.
Author's Original, .
(Submitted)
Abstract
The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data refers to a collection of standards which aim to enhance the world’s data, by interlinking datasets through the Web. The starting point is as simple as using URIs as global identifiers in data, but the technical challenges of managing data in this distributed setting are immense. An algebra is an essential contribution to this application domain. To verify the algebra several useful things are established. A high level language is defined that concisely captures query and update languages for Linked Data. The language is provided with a concise operational semantics. The natural notions of equivalence, contextual equivalence, is shown to coincide with the bisimulation proof technique. Ultimately, bisimulation allows the algebra proven to be correct. Some novel techniques are used in establishing these results.
Text
sparqlUpAlgSubm.pdf
- Author's Original
Text
UpdateAlg.pdf
- Other
More information
Submitted date: January 2012
Keywords:
linked data, sparql
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 273248
URI: http://eprints.soton.ac.uk/id/eprint/273248
PURE UUID: c084a6dd-e3ff-4e4e-947b-569beca8e65a
Catalogue record
Date deposited: 29 Feb 2012 21:10
Last modified: 14 Mar 2024 10:22
Export record
Contributors
Author:
Ross Horne
Author:
Vladimiro Sassone
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics