hbase-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From yun peng <pengyunm...@gmail.com>
Subject Re: How does BlockCache find relevant Blocks?
Date Wed, 29 May 2013 12:07:43 GMT
Thanks for the clarification, and I am interested in knowing a bit deep...

So how does hbase maintains which block is in memory and which is not.
is there an extra level of index (like meta data index) here in memory? if
there
is, is it a hash index or other?...

Regards
Yun


On Wed, May 29, 2013 at 7:45 AM, Anoop John <anoop.hbase@gmail.com> wrote:

> There is an index for the blocks in a HFile. This index contains details
> like start row in the block, its offset and length in the HFile...   So as
> a 1st setp to get a rowkey, we will find this rk can be present in which
> HFile block.. (I am assuming only one HFile as of now)..   Now we will see
> whether this block is already present in the block cache or not. If so try
> finding the row within that block..   If this HFile block is not present in
> the cache, we will load it from HDFS..
>
> Hope this helps u..
>
> -Anoop-
>
> On Wed, May 29, 2013 at 4:40 PM, yun peng <pengyunmomo@gmail.com> wrote:
>
> > Hi, All,
> > Given a large-sized BlockCache, I am wondering how HBase performs to
> search
> > a block of a requested rowkey. Is there any index structure (in-memory)
> > inside BlockCache? or it search in a brute force way, (which seems
> unlikely
> > though :-...)
> >
> > I am aware of reference guide online, but have not yet find the answer...
> > http://hbase.apache.org/book.html#block.cache
> >
> > Thx,
> > Yun
> >
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message