hadoop-common-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Mork0075 <mork0...@googlemail.com>
Subject Re: Why is scaling HBase much simpler then scaling a relational db?
Date Thu, 21 Aug 2008 15:48:08 GMT
Thank you, but i still don't got it.

I've read tons of websites and papers, but there's no clear und founded 
answer "why use BigTable instead of relational databases".

MySQL Cluster seams to offer the same scalabilty and level of 
abstraction, whithout switching to a non relational pardigm. Lots of 
blog posts are highly emotional, without answering the core question:

"Why RDBMS don't scale and why something like BigTable do". Often you 
read something like this:

"They have also built a system called BigTable, which is a Column 
Oriented Database, which splits a table into columns rather than rows 
making is much simpler to distribute and parallelize."


Really confusing ... ;)

Stuart Sierra schrieb:
> On Tue, Aug 19, 2008 at 9:44 AM, Mork0075 <mork0075@googlemail.com> wrote:
>> Can you please explain, why someone should use HBase for horizontal
>> scaling instead of a relational database? One reason for me would be,
>> that i don't have to implement the sharding logic myself. Are there other?
> A slight tangent -- there are various tools that implement sharding
> over relational databases like MySQL.  Two that I know of are
> DBSlayer,
> http://code.nytimes.com/projects/dbslayer
> and MySQL Proxy,
> http://forge.mysql.com/wiki/MySQL_Proxy
> I don't know of any formal comparisons between sharding traditional
> database servers and distributed databases like HBase.
> -Stuart

View raw message