Re: Slim RDF

This maps fairly closely to my implementation.  I've attached a Java file
with the primary source interface for discussion purposes.  If you strip
away the "java-isms" in it, it's basically what you describe.  I find it to
be very useful as a general purpose library.  This is a bit crude (it's an
early version) but the ideas are straightforward.

Tuple-based techniques can be used to solve a large set of problems.

If you are concerned with manipulating tuples instead of adhering to RDF
guidelines, URIs are a convenience rather than a necessity.  All you need is
a sense of identity.  An additional sense of order (such as lexicographical
ordering) can be used to optimize implementation.

----- Original Message -----
From: "Sergey Melnik" <melnik@db.stanford.edu>
To: "RDF Interest Group" <www-rdf-interest@w3.org>
Sent: Monday, February 12, 2001 3:08 PM
Subject: Slim RDF


> Following the recent discussion on wrt syntax and namespaces I'd like to
> mention the internal data model based on RDF that I'm using in my
> research:
>
> Let U be the Unicode alphabet and U* the set of strings defined over U.
> The set of entities E and the set of statements V are defined using the
> following recursive definition:
>
> 1. U*xU* is subset of E (any tuple consisting of two strings is an
> entity; the first string of the tuple is called namespace of the entity,
> the second string is referred to as name of the entity)
>
> 2. ExExE is subset of V (every tuple of three entities constitutes a
> statement)
>
> 3. V is subset of E (every statement is an entity)
>
> A subset of V is called "model". Without reification, E=U*xU* and V=E^3.