Hi, I have loaded dbpedia's dump on virtuoso and i'm provided with 3.200.000 real-world queries from dbpedia.
I need to analyze the paths that are traversed by the virtuoso engine in order to answer these queries. So basically I'd like to build a directed weighted graph G where: - the vertices of G are the vertices of D (DBedia's graph) - two vertices v1,v2 of G are connected if I went from v1 to v2 or from v2 to v1 in D in order to answer one of the queries - the weight of the edge is the number of times i traversed one of the edges connecting v1 and v2 (without considering the direction) Also, the queries might not return any result for two reasons: 1) there's no data to answer the query, so basically D is not traversed at all 2) the graph is traversed but no matching data is found to put in the result set I'd like to filter out queries in set (1). Does anybody have an advice about how to tackle these problems with virtuoso? I guess I'll have to modify the code of the engine to get this information, is that correct? Best, Claudio -- Claudio Martella Free University of Bolzano Faculty of Computer Science PhD Student claudio.marte...@stud-inf.unibz.it
