- From: Mauro Dragoni <dragoni@fbk.eu>
- Date: Thu, 15 May 2014 16:33:39 +0200
- To: semantic-web@w3.org
- Message-ID: <CAFvSjQtxw3mBN9NA9vtoi=8Bnkw7L4YkaJaUC7s8n81KvnHfpg@mail.gmail.com>
The only two things that come in my mind, both using Java, are: - to load the named graphs in a Jena object and then to query them by using SPARQL: http://jena.apache.org/tutorials/sparql_datasets.html - to do the same thing above but using the NG4J extension of Jena: http://wifo5-03.informatik.uni-mannheim.de/bizer/ng4j/ I hope that it helps. Mauro. On Thu, May 15, 2014 at 4:22 PM, Diego Reforgiato < diego.reforgiato@istc.cnr.it> wrote: > Hi Mauro, > no, we will adapt to the one with the highest performances. > > Best > Diego > > > On 5/15/14 4:10 PM, Mauro Dragoni wrote: > > Hi Diego, > any restriction on the programming language? > > Mauro. > > > On Thu, May 15, 2014 at 4:04 PM, Diego Reforgiato < > diego.reforgiato@istc.cnr.it> wrote: > >> Dear all, >> we need to deal with the several named graphs and would need to choose >> the framework that best handles named graphs and their serialization. As >> they have several relations among them, we need to be able to query them >> efficiently. >> >> We have used so far rdflib from Python code and the querying seems very >> slow. >> >> Any suggestion? >> >> Best >> Diego Reforgiato >> >> > >
Received on Thursday, 15 May 2014 14:34:30 UTC