- From: Kingsley Idehen <kidehen@openlinksw.com>
- Date: Mon, 24 Nov 2014 11:54:23 -0500
- To: public-hydra@w3.org
- Message-ID: <547362BF.1010701@openlinksw.com>
On 11/24/14 9:15 AM, Ruben Verborgh wrote: >> are you inferring that SPARQL query solutions against your HDT based static datatet are faster than Virtuoso against the same static dataset? > Of course not; I made this clear in my earlier mail; > not to mention in the study we published before: > http://linkeddatafragments.org/publications/iswc2014.pdf#page=13 > I can't be more clear and honest than that, I'm afraid. > >>> >>We have measured that HDT performs the combination of >>> >>“looking up data corresponding to a triple pattern” >>> >>plus “give an estimate count of the number of matching triples” >>> >>faster than Virtuoso or any other DBMS we tested. >>> >>For numbers, seehttp://linkeddatafragments.org/publications/ldow2014.pdf#page=7. >> > >> >Why a PDF? You should have a collection of SPARQL Protocol URLs to backup up your claim. > Actually, no—SPARQL Protocol URLs would not back up my claim at all, > since it was not about SPARQL in the first place. > >> >Then we have something that we can respond to, with ease:) > There's nothing to respond to really; all that I'm saying is: > We measured how fast triple pattern fragments can be generated > using either a DBMS or the HDT format as backend. HDT was faster for that job. > > The experiment is reproducible: > 1. Installhttps://github.com/LinkedDataFragments/Server.js/ and a DBMS on a machine; > 2. Ingest a dataset into the DBMS and convert it to HDT. > 3. Configure the server for the DBMS and for HDT. > 4. Access triple pattern fragments and measure access times. > > So if you want to respond, please measure this and share your measurements, like I did. > >> >BTW -- can you share with me, via a URL, an example of a multiple statement triple pattern fragment? > By definition, a “multiple statement triple pattern fragment” does not exist. > http://www.hydra-cg.com/spec/latest/triple-pattern-fragments/#definition Assuming that having looked up the URI above, what I read implies the following isn't possible: ?s ?p ?o. ?o ?p1 ?o2 . If that's true, then you *seem* to be claiming that a single sentence (a triple pattern) is all that can be thrown at this variant of RDF data source. Thus, what happens to situations where more than one sentence (be it comprised of constants or variables) is required for seeking information from these HDT encoded RDF data sources? -- Regards, Kingsley Idehen Founder & CEO OpenLink Software Company Web: http://www.openlinksw.com Personal Weblog 1: http://kidehen.blogspot.com Personal Weblog 2: http://www.openlinksw.com/blog/~kidehen Twitter Profile: https://twitter.com/kidehen Google+ Profile: https://plus.google.com/+KingsleyIdehen/about LinkedIn Profile: http://www.linkedin.com/in/kidehen Personal WebID: http://kingsley.idehen.net/dataspace/person/kidehen#this
Attachments
- application/pkcs7-signature attachment: S/MIME Cryptographic Signature
Received on Monday, 24 November 2014 16:54:46 UTC