W3C home > Mailing lists > Public > www-rdf-interest@w3.org > July 2004

Re: SIMILE Store Report

From: Damian Steer <damian.steer@hp.com>
Date: Thu, 29 Jul 2004 12:29:26 +0100
Message-Id: <8C3F866B-E152-11D8-AE54-000D932B9016@hp.com>
Cc: www-rdf-interest@w3.org
To: Andrew Newman <andrew@tucanatech.com>

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1


On 29 Jul 2004, at 12:00, Andrew Newman wrote:

>> It could be that the queries are unusually small, in 3store the  
>> networking
>> overhead can become the biggest factor if the queries are unusually  
>> simple,
>> eg:
>> SELECT ?x WHERE (<a>, <b>, <c>), (<c>, <d>, ?x)
>> or things of that kind. The time to execute the query will be < 1ms,  
>> but
>> the HTTP request overhead is close to 2ms.
>
> I agree, the queries performed can make a huge difference.  For  
> example, if something like walk [1] was used to traverse up or down  
> predicates (like subClassOf) it would give a vastly different result  
> compared with doing it with individual queries.

I suspect (though Ryan will no doubt correct me) that what SIMILE needs  
is something like Joseki and BRQL's DESCRIBE [1], i.e. grab a bunch  
(vague enough? :-) of information about this resource (possibly  
plural).  I certainly could have done with something like that for  
brownsauce. Something like bNode closure may be enough, although it  
goes horribly wrong for FOAF data (I used something similar but which  
doesn't explode on FOAF).

Damian

[1]  
http://lists.w3.org/Archives/Public/public-rdf-dawg/2004JulSep/ 
0144.html
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (Darwin)

iD8DBQFBCN+cAyLCB+mTtykRAkh4AKCn9gRrl8FyvRQca/JKWxHpageJzACeIbw7
4mEOpdAlDtSBs+QeeF2svb4=
=d+iX
-----END PGP SIGNATURE-----
Received on Thursday, 29 July 2004 07:30:26 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 5 February 2014 07:14:58 UTC