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.
| Original language | English |
|---|---|
| Pages (from-to) | 20-33 |
| Number of pages | 14 |
| Journal | Electronic Proceedings in Theoretical Computer Science |
| Volume | 58 |
| DOIs | |
| Publication status | Published - 29 Jul 2011 |
| Event | 10th International Workshop on the Foundations of Coordination Languages and Software Architectures, FOCLASA 2011 - Aachen, Germany Duration: 10 Sept 2011 → 10 Sept 2011 |
Keywords
- linked data
- W3C standards
- query languages