A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
In this paper we summarize the architecture of Linked Data Templates, a uniform protocol for read-write Linked Data. We start by overviewing existing approaches as well as protocol constraints, and propose a declarative approach based on URI-representation mapping, defined as templates. We then introduce an abstract model for RDF CRUD interactions based on template matching, outline the processing model, and provide an example. We conclude that LDT provides a new way to build applications anddoi:10.5281/zenodo.5826249 fatcat:ghcw5fhtejbblbw7xzv7gnyoc4