Thank you for your reply Doug.. that is what i wanted to know.
On Tue, Feb 14, 2012 at 9:39 PM, Doug Meil wrote:
>
> I say "basically" because inside a Region there are Stores, and for each
> Store there are StoreFiles. For more info see:
>
> http://hbase.apache.org/book.html#regions.arch
>
>
>
I say "basically" because inside a Region there are Stores, and for each
Store there are StoreFiles. For more info see:
http://hbase.apache.org/book.html#regions.arch
On 2/14/12 11:06 AM, "Doug Meil" wrote:
>
>Keys are stored in sorted order, it's basically a binary search.
>
>
>
>
>On 2/
Keys are stored in sorted order, it's basically a binary search.
On 2/14/12 9:31 AM, "Vamshi Krishna" wrote:
>Thank you Doug..
>
>Onemore question is, If a particular region is found by looking at the
>range handeled by it, How is search performed within that region to find
>requested rowKe
Thank you Doug..
Onemore question is, If a particular region is found by looking at the
range handeled by it, How is search performed within that region to find
requested rowKey? Is it by linear search or binary search or any other
algorithm? Or for every row in that region, is there any hash val
re: "Now if that RegionServer has multiple
regions on it, how does the request get transfered to a correct region
which has the requested rowKey?"
See...
http://hbase.apache.org/apidocs/org/apache/hadoop/hbase/client/HTable.html#
getRegionLocation%28byte[],%20boolean%29
As described in Arch/Cl
Hi all, i have a small basic doubt regarding get() method which is used in
HTable. From the hbase book, under 8.3.Client section, i understood that,
when ever client sends a request like get(rowKey) on any htable instance,
from ROOT and META, it knows the regionserver where the regions holding
that
