You are viewing a plain text version of this content. The canonical link for it is here.

Posted to user@hbase.apache.org by Shushant Arora <sh...@gmail.com> on 2016/04/05 05:27:24 UTC

hbase custom scan

Hi

I have a requirement to scan a hbase table based on insertion timestamp.
I need to fetch the keys sorted by insertion timestamp not by key .

I can't made timestamp as prefix of key to avoid hot spotting.
Is there any efficient way possible for this requirement.

Thanks!

Re: hbase custom scan

Posted by Shushant Arora <sh...@gmail.com>.

table will have ~100 regions.

I did n't get the advantage of top rows from same vs different regions ?
They will come from different regions .

On Tue, Apr 5, 2016 at 9:10 AM, Ted Yu <yu...@gmail.com> wrote:

> How many regions does your table have ?
>
> After sorting, is there a chance that the top N rows come from distinct
> regions ?
>
> On Mon, Apr 4, 2016 at 8:27 PM, Shushant Arora <sh...@gmail.com>
> wrote:
>
> > Hi
> >
> > I have a requirement to scan a hbase table based on insertion timestamp.
> > I need to fetch the keys sorted by insertion timestamp not by key .
> >
> > I can't made timestamp as prefix of key to avoid hot spotting.
> > Is there any efficient way possible for this requirement.
> >
> > Thanks!
> >
>

Re: hbase custom scan

Posted by Ted Yu <yu...@gmail.com>.

How many regions does your table have ?

After sorting, is there a chance that the top N rows come from distinct
regions ?

On Mon, Apr 4, 2016 at 8:27 PM, Shushant Arora <sh...@gmail.com>
wrote:

> Hi
>
> I have a requirement to scan a hbase table based on insertion timestamp.
> I need to fetch the keys sorted by insertion timestamp not by key .
>
> I can't made timestamp as prefix of key to avoid hot spotting.
> Is there any efficient way possible for this requirement.
>
> Thanks!
>