Hello,
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
Is there no better way that works right now?
Let's say I create a an index starting with G like GOPS
can I not just query the index?
Or maybe create and extra table with graph names and use triggers that
update the
graph name table?
Even the method below, where each graph is queried separately only is
fast until dbpedia.org is excluded,
then it also needs 60 seconds.
Now, there are workarounds for this of course, like including the triple
<graph> rdf:type owl:Ontology in each graph and query for it
explicitly, but shouldn't it be possible without this hack in adequate time?
Regards,
Sebastian
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}} Limit 1
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}
Filter (?g != <http://www.openlinksw.com/schemas/virtrdf#>) }
Limit 1 ;
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}
Filter (
?g != <http://www.openlinksw.com/schemas/virtrdf#>
&& ?g != <http://localhost:8890/DAV>
)
} Limit 1 ;
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}
Filter (
?g != <http://www.openlinksw.com/schemas/virtrdf#>
&& ?g != <http://localhost:8890/DAV>
&& ?g != <http://ns.ontowiki.net/SysOnt/>
) } Limit 1 ;
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}
Filter (
?g != <http://www.openlinksw.com/schemas/virtrdf#>
&& ?g != <http://localhost:8890/DAV>
&& ?g != <http://ns.ontowiki.net/SysOnt/>
&& ?g != <http://www.w3.org/2002/07/owl#>
) } Limit 1 ;
sparql select ?g WHERE { GRAPH ?g {?s ?p ?o}
Filter (
?g != <http://www.openlinksw.com/schemas/virtrdf#>
&& ?g != <http://localhost:8890/DAV>
&& ?g != <http://ns.ontowiki.net/SysOnt/>
&& ?g != <http://www.w3.org/2002/07/owl#>
&& ?g != <http://dbpedia.org>
) } Limit 1 ;
Ivan Mikhailov schrieb:
Hello Sebastian,
The very next VOS release will contain special optimization for
sparql select distinct ?g where { graph ?g { ?s ?p ?o }}
Meanwhile you may use an built-in SQL procedure
DB.DBA.SPARQL_SELECT_KNOWN_GRAPHS() that produce such a list. In next
release, a variant of that procedure will be used in the compilation of
the above mentioned query.
Best Regards,
Ivan Mikhailov
OpenLink Software
http://virtuoso.openlinksw.com
On Fri, 2009-11-20 at 15:27 +0100, Sebastian Hellmann wrote:
Hello,
what is the fastest way to query for a list of graphs in the store
for the V5 and V6 series. I do not succeed to write a query that is
faster than 10 seconds.
I'm testing it on http://db0.aksw.org:8890/sparql , the latest VOS 6 ,
which has DBpedia loaded and some OntoWiki graphs.
I even tried this:
SELECT DISTINCT ?graph WHERE { GRAPH ?graph {?s rdf:type ?o}}
and it still needs almost 10 seconds, even if I call it very often,
hoping for the cache to kick in ...
Also a SQL query would be fine, but it needs to be fast
(it should be fast normally < 20ms )
It's for OntoWiki, so we also need a fast solution for the V5 series,
to be backward compatible.
Regards,
Sebastian
Expected result:
graph
http://www.openlinksw.com/schemas/virtrdf#
http://www.w3.org/2002/07/owl#
http://ns.ontowiki.net/SysOnt/
http://dbpedia.org
http://localhost/OntoWiki/Config/
------------------------------------------------------------------------------
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
