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

Re: N-Triples Parser for Python

From: Chris Purcell <cjp39@cam.ac.uk>
Date: Thu, 21 Oct 2004 01:37:11 +0100
Cc: www-rdf-interest@w3.org
To: "Phil Dawes" <pdawes@users.sf.net>
Message-Id: <589E0EF0-22F9-11D9-8F0F-000A957B97EE@cam.ac.uk>

How are you inputting the triples in the first place? This is where the 
MySQL limit bit me, and while I did some poking around to speed things 
up, I haven't yet put much time into it.
	[poking around] 
http://www.srcf.ucam.org/~cjp39/Current/KritTer:2004-08-02+WebLog

Cheers,
Chris

> I'm afraid not - I'm defining fast as 'fast enough for my needs' ;-)
> I haven't done any volume tps studies, and my loads are really low.
>
> Most triple-pattern-match queries (even reasonably complicated ones)
> come in at a few 10s to a few 100s of milliseconds.
> Label search queries are slow because they rely on a regex table scan
> - I'd be interested in strategies to speed this up (maybe a python
> lucene equivalent[1]).  I use veudas for interactive knowledge
> management servicing a handful of people, so anything under half a
> second is fine for me.
Received on Thursday, 21 October 2004 00:37:16 GMT

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