RE: RDF benchmarks

Just a thought - it should be possible/might be interesting to use
benchmarks from other database/query systems, such as RDBMS (maybe
factorised through relational algebra), ODBMS & XML DBs. The
inferencing/retrieval for these kinds of systems is relatively specialised,
and hence implementations will be optimised with particular kinds of task in
mind, so the benchmark results from e.g. Postgresql could act as a kind of
best-case marker.

I bet there's also quite a mass of material around from systems like Prolog
implementations.

Cheers,
Danny.

---
Danny Ayers
<stuff> http://www.isacat.net </stuff>


>-----Original Message-----
>From: www-rdf-interest-request@w3.org
>[mailto:www-rdf-interest-request@w3.org]On Behalf Of Geoff Chappell
>Sent: 21 April 2002 15:01
>To: RDF-Interest
>Subject: RDF benchmarks
>
>
>Does anyone know of any benchmarks for RDF query systems and/or
>repositories?  I'd like to have some standard measure of (at least): (a)
>triple insertion/deletion time, and (b) query performance against
>a sizeable
>kb (with and without inference).  I'd guess that the systems out
>there today
>vary enough in their capabilities that a single benchmark might be
>difficult
>to come up with, so I imagine some categorization of benchmarks and results
>would be necessary.
>
>Thanks for any info or comments.
>
>-Geoff Chappell
>
>
>

Received on Sunday, 21 April 2002 13:00:47 UTC