Well in fact it's a "sparse, distributed, persistent multidimensional sorted
map".
J-D
On Mon, Jul 14, 2008 at 4:09 PM, Marcus Herou <[EMAIL PROTECTED]>
wrote:
> Thanks guessed that as well.
>
> Guess i need to treat Hbase as a distributed sorted map then.
>
> Kindly
>
> //Marcus
>
> On Mon, Jul
Thanks guessed that as well.
Guess i need to treat Hbase as a distributed sorted map then.
Kindly
//Marcus
On Mon, Jul 14, 2008 at 9:57 PM, Jean-Daniel Cryans <[EMAIL PROTECTED]>
wrote:
> Marcus,
>
> The one thing you misunderstood is that the row key is not a column and I
> guess this is caus
Marcus,
The one thing you misunderstood is that the row key is not a column and I
guess this is caused by a RDBMS background ;) The reason why you want to
store reverted urls is that you want to have a fast scanner e.g. if you
fetch 30 lines and they are distributed on 30 different machines, the
p
Hi guys.
A simple question: Is only the row key sorted in HBase ?
What if you would like to obtain a scanner based on another column ? I
thought the "auto" sorted feature was one of the reasons you would like to
store for example urls in a reverted manner.
Have I misunderstood something ?
We di
