<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Google Big Table paper</title>
	<link>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/</link>
	<description>Ewan Silver</description>
	<pubDate>Tue, 06 Jan 2009 05:51:24 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Dan Creswell</title>
		<link>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1499</link>
		<dc:creator>Dan Creswell</dc:creator>
		<pubDate>Wed, 06 Sep 2006 08:08:22 +0000</pubDate>
		<guid>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1499</guid>
		<description>Re: data volume - I couldn't tell whether they were talking compressed or uncompressed form.

Re: random read - I seem to recall they allow the programmer to specify a transfer size and I think they also said, typically, it's 8k.  I guess they were after finding worst case performance.  Certainly would've liked to see the updated figures as well :)

I also noticed that they tend to be running several "services" on the same machine so BigTable, GFS etc - I would've expected more segmentation but maybe I/O is more of an issue for them than memory or CPU.</description>
		<content:encoded><![CDATA[<p>Re: data volume - I couldn&#8217;t tell whether they were talking compressed or uncompressed form.</p>
<p>Re: random read - I seem to recall they allow the programmer to specify a transfer size and I think they also said, typically, it&#8217;s 8k.  I guess they were after finding worst case performance.  Certainly would&#8217;ve liked to see the updated figures as well <img src='http://ewansilver.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>I also noticed that they tend to be running several &#8220;services&#8221; on the same machine so BigTable, GFS etc - I would&#8217;ve expected more segmentation but maybe I/O is more of an issue for them than memory or CPU.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ewan</title>
		<link>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1455</link>
		<dc:creator>Ewan</dc:creator>
		<pubDate>Sat, 02 Sep 2006 14:54:52 +0000</pubDate>
		<guid>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1455</guid>
		<description>I agree - "interesting" choice of name.

A few other points I thought were interesting on an initial skim:

1. the volume of data that is being stored in the system ie the web crawl contains 800TB in 1000 billion cells. 1000 billion is quite a large number. I would have thought the 800TB is a low figure for the size of the web though...

2. the fact that the random read performance suffers quite badly as the number of tablet servers increases. As they point out this is due to the fact that they shift around 64kb blocks even though the required cell data might only contain a kb or so and the network/cpu overhead ends up saturating. Would have been nice to see how the system performs with a reduced block size - 8kb?

3. Fijnally: 

"&lt;i&gt;One lesson we learned is that large distributed systems
are vulnerable to many types of failures, not just
the standard network partitions and fail-stop failures assumed
in many distributed protocols.&lt;/i&gt;"

Yep - this stuff is hard!</description>
		<content:encoded><![CDATA[<p>I agree - &#8220;interesting&#8221; choice of name.</p>
<p>A few other points I thought were interesting on an initial skim:</p>
<p>1. the volume of data that is being stored in the system ie the web crawl contains 800TB in 1000 billion cells. 1000 billion is quite a large number. I would have thought the 800TB is a low figure for the size of the web though&#8230;</p>
<p>2. the fact that the random read performance suffers quite badly as the number of tablet servers increases. As they point out this is due to the fact that they shift around 64kb blocks even though the required cell data might only contain a kb or so and the network/cpu overhead ends up saturating. Would have been nice to see how the system performs with a reduced block size - 8kb?</p>
<p>3. Fijnally: </p>
<p>&#8220;<i>One lesson we learned is that large distributed systems<br />
are vulnerable to many types of failures, not just<br />
the standard network partitions and fail-stop failures assumed<br />
in many distributed protocols.</i>&#8221;</p>
<p>Yep - this stuff is hard!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan Creswell</title>
		<link>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1450</link>
		<dc:creator>Dan Creswell</dc:creator>
		<pubDate>Sat, 02 Sep 2006 09:25:17 +0000</pubDate>
		<guid>http://ewansilver.com/blog/2006/09/01/google-big-table-paper/#comment-1450</guid>
		<description>And having read it I can tell you that there's another paper due for release on Google's HA distributed lock manager (apparently called Chubby, errr, wouldn't have been my choice).</description>
		<content:encoded><![CDATA[<p>And having read it I can tell you that there&#8217;s another paper due for release on Google&#8217;s HA distributed lock manager (apparently called Chubby, errr, wouldn&#8217;t have been my choice).</p>
]]></content:encoded>
	</item>
</channel>
</rss>
