Partitioning by range allows for efficient range scans.  Logically the
ranges act like accessing a sorted list with a indexing hints.

Other systems that by default to hashing will not be able to efficiently
scan though all its data sequentially.  The nice thing with hbase though is
that you can choose to hash your hbase row key and achieve efficient kv
access by effectively converting it into a hash.

Hbase stared life as a google big table inspired system, and took many
design cues from there.


On Sunday, August 17, 2014, 乃岩 <[EMAIL PROTECTED]> wrote:

// Jonathan Hsieh (shay)
// HBase Tech Lead, Software Engineer, Cloudera
// [EMAIL PROTECTED] // @jmhsieh

NEW: Monitor These Apps!
elasticsearch, apache solr, apache hbase, hadoop, redis, casssandra, amazon cloudwatch, mysql, memcached, apache kafka, apache zookeeper, apache storm, ubuntu, centOS, red hat, debian, puppet labs, java, senseiDB