ime descending order, just use Long.MAX_VALUE - stamp.
>
> When reading the value you will have to take Long.MAX_VALUE - stored_value =
> stamp;
>
> JG
>
> Qingyan(Evan) Liu wrote:
>>
>> hi chubert,
>>
>> your comment is really valuable. I'm consider
Zhang
>
> On Tue, Jul 14, 2009 at 2:23 AM, stack wrote:
>
>> Please add a link to the below either to presentations or articles up on
>> the
>> hbase wiki.
>>
>> Thanks for the excellent contribution filling a hole we have had in our
>> document
e have had in our
> documentation with a while now.
>
> Yours,
> St.Ack
>
> On Mon, Jul 13, 2009 at 11:08 AM, Qingyan(Evan) Liu
> wrote:
>
>> Dears,
>>
>> I've just finished some slides about some cases of designing hbase
>> table schemas. Pleas
Hi Piyush,
I think you just wanna fetch the most recent 20 updates for a user, do you?
If so, you can just use versions for the updates, and let hbase keep
only 20 versions, IMO.
How about?
sincerely,
Evan
2009/7/13 Piyush Goel :
> Hi,
>>
>>
>> I am trying to design a high scale key value storag
help performance
> significantly when your blocks are available in the cache. The reason you did
> not see performance boosts in scans after warm-up was because of what i
> describe above; it was really measuring RPC performance because in an open
> scanner with small rows, the fetch o
- blocksize: 65536
- in_memory: false
- blockcache: true
sincerely,
Evan
2009/7/9 Jean-Daniel Cryans
> Even,
>
> The scan probably warmed the cache here. Do the same experiment with a
> fresh HBase for the scan and the random reads.
>
> J-D
>
>
dears,
I'm fresh to hbase. I just checkout hbase trunk rev-792389, and test its
performance by means of org.apache.hadoop.hbase.PerformanceEvaluation
(Detailed testing results are listed below). It's strange that the scan
speed is as slower as randomRead. I haven't change any configuration
paramet
