You are viewing a plain text version of this content. The canonical link for it is here.
Posted to user@hbase.apache.org by Al Lias <al...@gmx.de> on 2010/03/04 09:22:40 UTC
Performance with many KV's per row
If I have many values for a given row/family, will they be scanned
sequentially upon retrieval (say with a get) in the region server?
Is it a difference, if I look for a specific column or a timestamp (or
range) or any other Filter?
The Bloomfilter (once back) will help here?
thx,
Al
Re: Performance with many KV's per row
Posted by Erik Holstad <er...@gmail.com>.
Hey Al!
There are indexes to the files that you are looking in but as far as I know
not to all rows
which means that you have to "scan" a few keyvalues before getting to the
one you want.
The BloomFilter would only help in the case of a Get operation, for a Scan
you still need
to open up all files. The only thing that filters and specifying a timestmp
for example does
is to return faster, the approach is still the same.
Hope that helps
--
Regards Erik