Mapping RDF to a Sequence

On the web, any information published about resources of LD is represented using the RDF.

Each expression in RDF is a collection of triples, a triple consists of a subject,a predicate (also called property) and an object. The subject of a triple is the URI describing resource. The object can either be a simple literal value (e.g.,a string, a number) or the URI of another resource. The predicate indicates what kind of relation exists between subject and object. The predicate is a URI too. A set of such triples is called an RDF graph. This can be illustrated by a node and directed-arc diagram, in which each triple is represented as a node-arc-node link.

Since a set is implemented by means of a list, then we can use operations such as insert and delete to edit a shared list. Thus, we can reuse the state-of-the-art of collaborative editing systems [10]. For instance, the following group of statements “there is a Person” identified by http://www.w3.org/People/EM/ contact#me (this example is taken from [8]):

Fig. 2. An RDF Graph

- http://www.w3.org/People/EM/contact#me has a name whose value is Eric Miller - http://www.w3.org/People/EM/contact#me has a title whose value is Dr. - http://www.w3.org/People/EM/contact#me has a email address whose value is em@w3.org

An RDF graph can be serialized into a sequence of triples and considered as a text where each line corresponds to a simple triple of subject, predicate and object. For example, the first statement shown in Figure 2 would be written as a text line (subject, predicate, object):

http://www.w3.org/People/EM/contact\#me http://www.w3.org/2000/10/swap/pim/contact\#fullName "Eric Miller"

~

MECHAOUI, Moulay Driss, GUETMI, Nadir and IMINE, Abdessamad, 2015. Mobile Co-Authoring of Linked Data in the Cloud. In: MORZY, Tadeusz, VALDURIEZ, Patrick and BELLATRECHE, Ladjel (eds.), New Trends in Databases and Information Systems. Cham: Springer International Publishing. p. 371–381. Communications in Computer and Information Science. ISBN 978-3-319-23200-3. doi [Accessed 18 December 2023].