A Verified Algebra for Linked Data
A Verified Algebra for Linked Data
A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links. This work focuses on emerging W3C standards which specify query languages for Linked Data. The approach is to provide an abstract syntax to capture Linked Data structures and queries, which are then internalised in a process calculus. An operational semantics for the calculus specifies how queries, data and processes interact. A labelled transition system is shown to be sound with respect to the operational semantics. Bisimulation over the labelled transition system is used to verify an algebra over queries. The derived algebra is a contribution to the application domain. For instance, the algebra may be used to rewrite a query to optimise its distribution across a cluster of servers. The framework used to provide the operational semantics is powerful enough to model related calculi for the Web.
linked data, sparql
20-33
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Revara, Antonio
5374306e-4375-45f6-aa17-d1a38f3e7e0d
Mousavi, MohammadReza
55b8adab-2c37-4c6c-b415-c9c6e380666b
10 August 2011
Horne, Ross
4847dccd-7a84-44b7-9402-341d942c9427
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Revara, Antonio
5374306e-4375-45f6-aa17-d1a38f3e7e0d
Mousavi, MohammadReza
55b8adab-2c37-4c6c-b415-c9c6e380666b
Horne, Ross and Sassone, Vladimiro
(2011)
A Verified Algebra for Linked Data.
Revara, Antonio and Mousavi, MohammadReza
(eds.)
10th International Workshop on the Foundations of Coordination Languages and Software Architectures, EPTCS 58, Aachen, Germany.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links. This work focuses on emerging W3C standards which specify query languages for Linked Data. The approach is to provide an abstract syntax to capture Linked Data structures and queries, which are then internalised in a process calculus. An operational semantics for the calculus specifies how queries, data and processes interact. A labelled transition system is shown to be sound with respect to the operational semantics. Bisimulation over the labelled transition system is used to verify an algebra over queries. The derived algebra is a contribution to the application domain. For instance, the algebra may be used to rewrite a query to optimise its distribution across a cluster of servers. The framework used to provide the operational semantics is powerful enough to model related calculi for the Web.
Text
sparqlFOCLASAfin.pdf
- Other
More information
Published date: 10 August 2011
Additional Information:
Event Dates: 10th September 2011
Venue - Dates:
10th International Workshop on the Foundations of Coordination Languages and Software Architectures, EPTCS 58, Aachen, Germany, 2011-09-10
Keywords:
linked data, sparql
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 271744
URI: http://eprints.soton.ac.uk/id/eprint/271744
PURE UUID: 57d43f06-0bf5-40c5-bb79-4caa5b099323
Catalogue record
Date deposited: 02 Dec 2010 16:11
Last modified: 14 Mar 2024 09:38
Export record
Contributors
Author:
Ross Horne
Author:
Vladimiro Sassone
Editor:
Antonio Revara
Editor:
MohammadReza Mousavi
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