W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > January 2002

Modeling untidiness in tidy graphs

From: Sergey Melnik <melnik@db.stanford.edu>
Date: Thu, 31 Jan 2002 16:58:08 -0800
Message-ID: <3C59E820.7AAFBF2C@db.stanford.edu>
To: RDFCore WG <w3c-rdfcore-wg@w3.org>
This is a side remark for those who like/need untidiness on literals for
certain purposes.

In a tidy graph model, untidiness can be modeled using bNodes.

For example, an untidy graph

_:a --dc:Title--> "Big Bang"
_:b --my:book---> "Big Bang"

can be represented e.g. as a tidy graph

_:a --dc:Title--> _:1 --rdf:value--> "Big Bang"
_:b --my:book---> _:2 --rdf:value------+

Sticking with the tidy graph model does not limit expressivity, but has
the benefit of being in widespread use, simpler, and more compact (when
untidiness is not required).

Received on Thursday, 31 January 2002 19:28:10 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 20:24:08 UTC