Hi Stack, Thanks for info. Then how is it usually done with time-based keys? General recommendation is prepend timestamp with something random prefix to shard table properly. But what if I want to scan table for certain time range? Scan whole table, skipping random prefix and filter by time range? In this case I find BinaryRangeComparator useful, however I suppose it's not a common solution for this use case.
Regards, Alexandr Vasilenko 2012/2/9 Stack <[email protected]> > On Thu, Feb 9, 2012 at 10:03 AM, Alex Vasilenko <[email protected]> > wrote: > > I'm a brand new user of hbase and hadoop in general. Trying to evaluate > > hbase for our needs. Question is: why there's BinaryPrefixComparator, but > > no BinaryRangeComparator, where you specify what range of key should be > > compared. Are there any concerns about using it? > > > > Welcome. > > My guess is that no one had the need of a BinaryRangeComparator up to this. > > I do not see an issue w/ you writing such a filter > BinaryRangeComparator if you need it. > > St.Ack >
