search

recurse / rdfquery

Automatically exported from code.google.com/p/rdfquery
0 stars 0 forks source link

RDFa parsing is slow #1

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
When there are lots of triples in a page, parsing the RDFa is significantly 
slower than using, say, Ben 
Adida's library. Needs some attention.

Original issue reported on code.google.com by jeni.ten...@gmail.com on 11 Nov 2008 at 4:12

GoogleCodeExporter commented 9 years ago 
Some improvements already within the 'rules' branch, including caching the 
results of gathering namespaces.

Original comment by jeni.ten...@gmail.com on 12 Nov 2008 at 7:50

GoogleCodeExporter commented 9 years ago 
Initial work on this has produced a speed up of about three/four times (eg from 
8-9
seconds to 1.5-2 seconds). No doubt I'll have to address further optimisation 
in the
future, but I'm going to put this on the back burner for now.

If anyone has particular examples that take a long time to process, please send 
them in.

Original comment by jeni.ten...@gmail.com on 19 Nov 2008 at 10:03

GoogleCodeExporter commented 9 years ago 
Dear Denilson, I need your help.
Following the tutorial rdfQuery could not do consultations (experiments with 
existing
examples) due to the fact that the codes are in half.
I would like to see an example of consultation in the middle of HTML code.
Despite having read the tutorial, still full of questions about how to 
structure a
query based on the foaf rdfa and contained on a page.
You could make a case more friendly?

Thank you very much.

Original comment by perpetuopeixinho@gmail.com on 10 Mar 2010 at 11:37