Sorry misunderstood your question. In that case you'd just use a scanner (see Scan.java) and set that startKey and the endKey. That will give you that range of keys and it do so efficiently, as it can seek forward to the startKey.
-- Lars ________________________________ From: Alex Vasilenko <[email protected]> To: [email protected] Sent: Thursday, February 9, 2012 10:40 AM Subject: Re: row filter - binary comparator at certain range Lars, I meant range of row keys. BinaryPrefixComparator can be used in conjunction with RowFilter to filter by prefix. Alex 2012/2/9 lars hofhansl <[email protected]> > Note the BinaryPrefixComparator compares values (not keys). > Not sure that this is what you want, but you mention a "range of key". > > > For keys there are ColumnPrefixFilter and ColumnRangeFilter. > > > -- Lars > > > > ________________________________ > From: Alex Vasilenko <[email protected]> > To: [email protected] > Sent: Thursday, February 9, 2012 10:03 AM > Subject: row filter - binary comparator at certain range > > Hi all, > > 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? > > Thanks, > Alexandr Vasilenko >
