<?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: Introduction to Aster Data and nCluster</title>
	<atom:link href="http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/</link>
	<description>Choices in data management and analysis</description>
	<lastBuildDate>Thu, 09 Feb 2012 16:57:09 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.3</generator>
	<item>
		<title>By: Confluence: Client: Telefonica I+D</title>
		<link>http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/#comment-158366</link>
		<dc:creator>Confluence: Client: Telefonica I+D</dc:creator>
		<pubDate>Fri, 05 Feb 2010 15:23:00 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=514#comment-158366</guid>
		<description>&lt;strong&gt;personalization server old code and architecture review...&lt;/strong&gt;

(form SVN) (see part list at...</description>
		<content:encoded><![CDATA[<p><strong>personalization server old code and architecture review&#8230;</strong></p>
<p>(form SVN) (see part list at&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Web analytics &#8212; clickstream and network event data &#124; DBMS2 -- DataBase Management System Services</title>
		<link>http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/#comment-97766</link>
		<dc:creator>Web analytics &#8212; clickstream and network event data &#124; DBMS2 -- DataBase Management System Services</dc:creator>
		<pubDate>Mon, 22 Sep 2008 10:11:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=514#comment-97766</guid>
		<description>[...] Data&#8217;s largest disclosed database, by almost two orders of magnitude, is at [...]</description>
		<content:encoded><![CDATA[<p>[...] Data&#8217;s largest disclosed database, by almost two orders of magnitude, is at [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Roger</title>
		<link>http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/#comment-96642</link>
		<dc:creator>Roger</dc:creator>
		<pubDate>Wed, 03 Sep 2008 21:53:26 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=514#comment-96642</guid>
		<description>What their pricing model? Per terabyte? And how much it costs?</description>
		<content:encoded><![CDATA[<p>What their pricing model? Per terabyte? And how much it costs?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Steve Wooledge</title>
		<link>http://www.dbms2.com/2008/09/02/introduction-to-aster-data-and-ncluster/#comment-96620</link>
		<dc:creator>Steve Wooledge</dc:creator>
		<pubDate>Wed, 03 Sep 2008 18:21:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.dbms2.com/?p=514#comment-96620</guid>
		<description>Hi Curt,

Thanks for the post.  Just a couple points for clarification:

[1] At MySpace, every piece of data has 2 copies on distinct nodes.  More specifically, at MySpace, as well as our other customers, they use RAID 0 on the Aster Worker nodes and RAID 10 on the Aster Queen nodes. [more on our 3-tiered architecture here: (http://www.asterdata.com/product/architecture.html)]  Our recommendation is to always use RAID 0 on the workers, because it gives you better performance when a disk fails: with RAID10, if a disk fails, the node stays available, but the performance of that node drops by 50% (and, thus, the performance of the cluster).   Because we have full replication and transparent failover, in Aster nCluster if a disk fails, the entire node goes down, but nCluster’s performance only drops by 1/n th (where n is the number of nodes).

[2] re: &quot;parallel query&quot; - The local GROUP BYs is an example; our query optimization algorithms cover the relational algebra and not just 1 case.</description>
		<content:encoded><![CDATA[<p>Hi Curt,</p>
<p>Thanks for the post.  Just a couple points for clarification:</p>
<p>[1] At MySpace, every piece of data has 2 copies on distinct nodes.  More specifically, at MySpace, as well as our other customers, they use RAID 0 on the Aster Worker nodes and RAID 10 on the Aster Queen nodes. [more on our 3-tiered architecture here: (<a href="http://www.asterdata.com/product/architecture.html)" rel="nofollow">http://www.asterdata.com/product/architecture.html)</a>  Our recommendation is to always use RAID 0 on the workers, because it gives you better performance when a disk fails: with RAID10, if a disk fails, the node stays available, but the performance of that node drops by 50% (and, thus, the performance of the cluster).   Because we have full replication and transparent failover, in Aster nCluster if a disk fails, the entire node goes down, but nCluster’s performance only drops by 1/n th (where n is the number of nodes).</p>
<p>[2] re: &#8220;parallel query&#8221; &#8211; The local GROUP BYs is an example; our query optimization algorithms cover the relational algebra and not just 1 case.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

