<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	>
<channel>
	<title>Comments on: Billions and billions&#8230;</title>
	<atom:link href="http://clarkparsia.com/weblog/2006/02/20/billions-and-billions/feed/" rel="self" type="application/rss+xml" />
	<link>http://clarkparsia.com/weblog/2006/02/20/billions-and-billions/</link>
	<description>Make lots of money through stealth in shadows</description>
	<pubDate>Wed, 07 Jan 2009 01:22:01 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.7</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Arjohn</title>
		<link>http://clarkparsia.com/weblog/2006/02/20/billions-and-billions/comment-page-1/#comment-51</link>
		<dc:creator>Arjohn</dc:creator>
		<pubDate>Wed, 22 Feb 2006 12:04:09 +0000</pubDate>
		<guid isPermaLink="false">http://clarkparsia.com/weblog/?p=28#comment-51</guid>
		<description>Based on the white paper, I would say this is an impressive piece of work. The white paper is a bit low on details though, and leaves me with many questions. Does the reported storage time include any inferencing? Did they use full ACID compliant transaction (apparently, this is optional)? Considering that the Lehigh University Benchmark was used for scalability testing, what are the results of the queries included with this benchmark?

Further, the reported 4000 triples/sec for data sets larger than 200M seems a bit arbitrary. This figure will likely go down as data sets grow. Also, performance depends on lots of factors, including the specifics of the data set that was used (see also: &lt;a href="http://jeenbroekstra.blogspot.com/2006/02/pitfalls-in-benchmarking-triple-stores.html" rel="nofollow"&gt;Pitfalls in Benchmarking Triple Stores&lt;/a&gt;).

The low-level API that is mentioned surprises me a bit: it doesn't include any operations for removing triples! Does this mean that you can't remove anything from their database?

Anyway, interesting read but it lacks a lot of details. Dr. Dobbs probably constrains the length of the article too much to be able to include such details. &lt;a href="http://www.franz.com/products/allegrocache/AllegroCache_White_Paper.pdf" rel="nofollow"&gt;This white paper&lt;/a&gt; gives some more info on the non-RDF parts of AllegroCache.</description>
		<content:encoded><![CDATA[<p>Based on the white paper, I would say this is an impressive piece of work. The white paper is a bit low on details though, and leaves me with many questions. Does the reported storage time include any inferencing? Did they use full ACID compliant transaction (apparently, this is optional)? Considering that the Lehigh University Benchmark was used for scalability testing, what are the results of the queries included with this benchmark?</p>
<p>Further, the reported 4000 triples/sec for data sets larger than 200M seems a bit arbitrary. This figure will likely go down as data sets grow. Also, performance depends on lots of factors, including the specifics of the data set that was used (see also: <a href="http://jeenbroekstra.blogspot.com/2006/02/pitfalls-in-benchmarking-triple-stores.html" rel="nofollow">Pitfalls in Benchmarking Triple Stores</a>).</p>
<p>The low-level API that is mentioned surprises me a bit: it doesn&#8217;t include any operations for removing triples! Does this mean that you can&#8217;t remove anything from their database?</p>
<p>Anyway, interesting read but it lacks a lot of details. Dr. Dobbs probably constrains the length of the article too much to be able to include such details. <a href="http://www.franz.com/products/allegrocache/AllegroCache_White_Paper.pdf" rel="nofollow">This white paper</a> gives some more info on the non-RDF parts of AllegroCache.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arjohn</title>
		<link>http://clarkparsia.com/weblog/2006/02/20/billions-and-billions/comment-page-1/#comment-8281</link>
		<dc:creator>Arjohn</dc:creator>
		<pubDate>Wed, 22 Feb 2006 09:04:09 +0000</pubDate>
		<guid isPermaLink="false">http://clarkparsia.com/weblog/?p=28#comment-8281</guid>
		<description>Based on the white paper, I would say this is an impressive piece of work. The white paper is a bit low on details though, and leaves me with many questions. Does the reported storage time include any inferencing? Did they use full ACID compliant transaction (apparently, this is optional)? Considering that the Lehigh University Benchmark was used for scalability testing, what are the results of the queries included with this benchmark?&lt;br&gt;&lt;br&gt;Further, the reported 4000 triples/sec for data sets larger than 200M seems a bit arbitrary. This figure will likely go down as data sets grow. Also, performance depends on lots of factors, including the specifics of the data set that was used (see also: &lt;a href="http://jeenbroekstra.blogspot.com/2006/02/pitfalls-in-benchmarking-triple-stores.html" rel="nofollow"&gt;Pitfalls in Benchmarking Triple Stores&lt;/a&gt;).&lt;br&gt;&lt;br&gt;The low-level API that is mentioned surprises me a bit: it doesn't include any operations for removing triples! Does this mean that you can't remove anything from their database?&lt;br&gt;&lt;br&gt;Anyway, interesting read but it lacks a lot of details. Dr. Dobbs probably constrains the length of the article too much to be able to include such details. &lt;a href="http://www.franz.com/products/allegrocache/AllegroCache_White_Paper.pdf" rel="nofollow"&gt;This white paper&lt;/a&gt; gives some more info on the non-RDF parts of AllegroCache.</description>
		<content:encoded><![CDATA[<p>Based on the white paper, I would say this is an impressive piece of work. The white paper is a bit low on details though, and leaves me with many questions. Does the reported storage time include any inferencing? Did they use full ACID compliant transaction (apparently, this is optional)? Considering that the Lehigh University Benchmark was used for scalability testing, what are the results of the queries included with this benchmark?</p>
<p>Further, the reported 4000 triples/sec for data sets larger than 200M seems a bit arbitrary. This figure will likely go down as data sets grow. Also, performance depends on lots of factors, including the specifics of the data set that was used (see also: <a href="http://jeenbroekstra.blogspot.com/2006/02/pitfalls-in-benchmarking-triple-stores.html" rel="nofollow">Pitfalls in Benchmarking Triple Stores</a>).</p>
<p>The low-level API that is mentioned surprises me a bit: it doesn&#8217;t include any operations for removing triples! Does this mean that you can&#8217;t remove anything from their database?</p>
<p>Anyway, interesting read but it lacks a lot of details. Dr. Dobbs probably constrains the length of the article too much to be able to include such details. <a href="http://www.franz.com/products/allegrocache/AllegroCache_White_Paper.pdf" rel="nofollow">This white paper</a> gives some more info on the non-RDF parts of AllegroCache.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
