W3C home > Mailing lists > Public > public-rdf-dawg-comments@w3.org > March 2010

Abstract syntax for updates

From: rjh06r <rjh06r@ecs.soton.ac.uk>
Date: Wed, 31 Mar 2010 16:32:01 +0100
To: <public-rdf-dawg-comments@w3.org>
Message-ID: <EMEW3|5358d7cd58386ee6f5f52edcf22be03dm2UGW306rjh06r|ecs.soton.ac.uk|18596bf1272ddd8fad092139e24fa037@ecs.soton.ac.uk>


I have been working on an abstract syntax for an RDF Update
language which deliberately has much in common with SPARQL Update. The
syntax presented, [1], concisely tackles several issues discussed in this
group. For instance... 

- Conditions (WHERE etc) are captured by guarding
updates with an internalised SPARQL query. 

- Blank nodes are handled by a
query discovering the node. The discovery moves the scope of the blank node
around the query so that they may be treated in the same way as URIs. 

Named graphs are primitive enabling the declaration of federated queries
and updates. 

- Optional extensions, choice and recursion, offer
significant power for updating linked lists and other linked data
structures. The syntax is fully concurrent. 

The languages is explained in
detail in the paper, [1]. The introduction replicates the examples in the
SPARQL update specification, if the syntax is a barrier. The last sentence
may be controversial. Perhaps the operational semantics mimic some of your



[1] http://eprints.ecs.soton.ac.uk/18602/

Received on Wednesday, 31 March 2010 16:27:23 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:52:10 UTC