hbase-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ted Yu <yuzhih...@gmail.com>
Subject Re: How Hbase achieves efficient random access?
Date Fri, 04 Jul 2014 14:39:30 GMT
For description of HFile v2, see http://hbase.apache.org/book.html#hfilev2

For block cache, see http://hbase.apache.org/book.html#block.cache

In "HBase In Action", starting page 28, there is description for read path.

Cheers


On Fri, Jul 4, 2014 at 2:02 AM, Intae Kim <inking007@gmail.com> wrote:

> Except memstore, blockcache, hfile count etc..
>
> Simply stated, data are sorted in file called HFile (composed of  blocks)
> when client try to access data, hbase search proper block in file and load
> block to check if the block has the data.
>
> See HFile Format in more details, (meta index, data index ...)
>
> Good Luck!!
>
>
> 2014-07-04 17:30 GMT+09:00 Ted Yu <yuzhihong@gmail.com>:
>
> > Please take a look at http://hbase.apache.org/book/perf.reading.html
> >
> > Cheers
> >
> > On Jul 4, 2014, at 12:22 AM, yl wu <wuyl6099@gmail.com> wrote:
> >
> > > Hi All,
> > >
> > > HBase has sorted and indexed Hfile format, which enables fast lookup.
> > > I am wondering is there any other feature help Hbase achieve efficient
> > > random access?
> > > I want to know the whole story, but I can't find any article talks
> about
> > > random access in HBase in high level.
> > >
> > > Can anyone help me resolve my confusion in this?
> > >
> > > Best,
> > > Yanglin
> >
>

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