OASIS Mailing List ArchivesView the OASIS mailing list archive below
or browse/search using MarkMail.


Help: OASIS Mailing Lists Help | MarkMail Help



   Why RDF is hard

[ Lists Home | Date Index | Thread Index ]

I've said RDF is simple, it's basically just

[node] ---arc---> [node]

or in N-triples form:

subject predicate object .

for example, note that nodes are named by URIrefs, stuff inside <..> is a
URIref, and QNames are converted to URIrefs:

<http://example.org/foo#XSD> rddl:purpose
<http://www.rddl.org/purposes#schema-validation> .
<http://example.org/foo#XSD> rddl:related <http://www.example.org/foo.xsd> .

but RDF gets hard fast. That's because the problems that RDF can be used to
solve might be very tricky problems. It's not that RDF *itself* is so
complicated, it's that its problem domain (e.g. unstructured databases or
"knowledge representation") is complicated.

This might be a good explanation:




News | XML in Industry | Calendar | XML Registry
Marketplace | Resources | MyXML.org | Sponsors | Privacy Statement

Copyright 2001 XML.org. This site is hosted by OASIS