So Timothy Prickett Morgan claims that DB2 outperforms TDB in a Cray Urika setup by factor 3.5 on some unspecified SPARQL 1.0 query?
On Tue, Apr 3, 2012 at 5:48 PM, Andy Seaborne <a...@apache.org> wrote: > http://www.theregister.co.uk/2012/04/03/ibm_db2_10_infosphere_10/ > > ------------------------------------------ > The Apache Jena project is a Java framework for building semantic web > applications based on graph data, and Apache Fuseki is the SPARQL server > that processes the SPARQL queries and spits out the relationships so they > can be visualized in some fashion. (Cray's new Urika system, announced in > March, runs this Apache graph analysis stack on top of a massively > multithreaded server.) > > Just like they imported objects and XML into the DB2 database so they could > be indexed and processed natively, IBM is now bringing in the RDF format so > that graph triples can be stored natively. > > As IBM explains it – not strictly grammatically, to some English majors – a > triple has a noun, a verb, and a predicate, such as Tim (noun) has won > (verb) the MegaMillions lottery (predicate). You can then query all aspects > of a set of triples to see who else has won MegaMillions – a short list, in > this case. > > In tests among DB2 10.1 early adopters, applications that used these graph > triples ran about 3.5 times faster on DB2 than on the Jena TDB data store > (short for triple database, presumably) with SPARQL 1.0 hitting it for > queries. > ------------------------------------------ > > (Dear Reg, TDB does not stand for "triple database") > > Andy -- --- Marco Neumann KONA Join us at SemTech Biz in San Francisco June 3-7 2012 and save 15% with the lotico community discount code 'STMN' http://www.lotico.com/evt/SemTechSF2012/
