Ivan Mikhailov schrieb:
Natan,
DB.DBA.SPARQL_SELECT_KNOWN_GRAPHS()
needs almost 100 seconds the first time and 20 seconds for consecutive
queries.
select GRAPH_IRI from DB.DBA.SPARQL_SELECT_KNOWN_GRAPHS_T ;
needs 20-50 seconds also
The question is the number of graphs returned by the procedure, the
speed in milliseconds per returned row.
I'm not so sure what you mean by milliseconds per row.
SQL> DB.DBA.SPARQL_SELECT_KNOWN_GRAPHS();
GRAPH_IRI
VARCHAR
_______________________________________________________________________________
http://www.openlinksw.com/schemas/virtrdf#
http://localhost:8890/DAV
http://www.w3.org/2002/07/owl#
http://ns.ontowiki.net/SysOnt/
http://localhost/OntoWiki/Config/
http://dbpedia.org
6 Rows. -- 21289 msec.
This is what I got, so it is either 3500 msec per row or
if you consider that the store contains
93 million triples, which are rows, then it is
0.00023 msec per row
So, I'm still not sure how to tackle it.
The List Graphs in the Conductor also needs quite some time.
Maybe, I'm doing something wrong?
Regards,
Sebastian
wonder what the time is on lod.openlinksw
lod.openlinksw.com is a bad specimen because it's cluster and I haven't
written cluster-optimized version of DB.DBA.SPARQL_SELECT_KNOWN_GRAPHS()
yet.
Best Regards,
Ivan Mikhailov
OpenLink Software
http://virtuoso.openlinksw.com
------------------------------------------------------------------------------
Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day
trial. Simplify your report design, integration and deployment - and focus on
what you do best, core application coding. Discover what's new with
Crystal Reports now. http://p.sf.net/sfu/bobj-july
_______________________________________________
Virtuoso-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/virtuoso-users
--
Dipl. Inf. Sebastian Hellmann
Department of Computer Science, University of Leipzig
Homepage: http://bis.informatik.uni-leipzig.de/SebastianHellmann
Research Group: http://aksw.org
