W3C home > Mailing lists > Public > www-rdf-interest@w3.org > August 2000

RDF Database Specifications

From: Alex Barnell <aeb99@doc.ic.ac.uk>
Date: Sun, 20 Aug 2000 13:09:00 +0100
Message-ID: <399FCA5B.C128B483@doc.ic.ac.uk>
To: "www-rdf-interest@w3.org" <www-rdf-interest@w3.org>
Hi,

I am interested in developing a RDF database with the following features:

1. Write access to the database is unrestricted

2. An RDF entry has the option of having a digital signature. The
encrpytion scheme, public key and signature should be associated with
all the triples making up the RDF entry. Digital signatures should
be checked on insertion to the database.

3. The database must be searchable in some manner, possibly similar to
an SQL select statement. The idea is to return the RDF entries that
satisfy the search criteria.

4. The search must allow approximate matches to be returned i.e. criteria
on string literals should allow up to n insertions/deletions/substitutions.
This would be similar to what Glimpse allows (www.webglimpse.org). A score
between 0.0 and 1.0 should be associated with each search result. The search
query should be able to specify both the maximum number of results desired, and
also a minimum score threshold for the results.

5. A search query must be able to specify a list of trusted public keys.
Only the triples associated with these public keys should be considered when
constructing search results.


Is anyone else working on similar projects? I am finding it hard to come up
with a database design that satisfies all these criteria.

Regards,
Alex
Received on Sunday, 20 August 2000 08:14:06 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:51:44 GMT