You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hbase.apache.org by "Doug Meil (JIRA)" <ji...@apache.org> on 2009/11/18 23:02:39 UTC

[jira] Created: (HBASE-1991) Architectural overview of HBase internals with description of conceptual gulf between HBase and HDFS

Architectural overview of HBase internals with description of conceptual gulf between HBase and HDFS
----------------------------------------------------------------------------------------------------

                 Key: HBASE-1991
                 URL: https://issues.apache.org/jira/browse/HBASE-1991
             Project: Hadoop HBase
          Issue Type: Improvement
          Components: documentation
    Affects Versions: 0.20.0
            Reporter: Doug Meil



One of the conceptual gulfs that needs addressing in HBase documentation is that if people are looking at the Hadoop website, they will read about HDFS that it is for (paraphrasing) "high throughput but does not promise low latency and is not suited for random reads."

HBase runs on top of HDFS, and it promises both low-latency *and* random reads.

How?

I'm not disputing that HBase does it...  but not much is written down anywhere other than references to "caching."

Lars George put together a great page on some of the HBase file structures as they are stored in HDFS.  Information like that would be useful to have in the HBase documentation, etc.






-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.