Thanks, I checked both HBASE-19008 and HBASE-15410, and understood the
reasons why it was changed back to a list from a set.
For now, what I am doing to not bloat up my filterlist is to create sets
which store the row keys so that the duplicates are eliminated, and then
use the set result to
I looked at Filter one more time this morning - it doesn't have method
which returns the row in which the Filter is interested in.
Since each of your RowFilter instances may be constructed from unique
objects in memory (though they can be considered equal after byte wise
comparison), we need more
Thanks for the response, I indeed have MUST_PASS_ONE operator defined for
the filterlist, and my list passes and returns result as well. I just
wanted to know how duplicate filters are handled within filterlist, which
you already clarified by saying that it would bloat up the list.
In this case,
Assuming your filter list uses MUST_PASS_ONE operator, the recurring key
would pass one of these RowFilter's. So the filter list would pass.
However, depending on the actual number of repetitions for a given key,
your filter list would be bloated.
You can use ByteArrayComparable#getValue() to
For example,
I have an iterative process which generates the key and inserts the key as
a RowFilter in a filter list.
For example:
for(String k:keys){
filterlist.addfilter(new RowFilter(EQ, BinaryComparator(k)))
}
Now if the list "keys" has same keys multiple times, we are adding the
Did you mean chaining the same row filter 'n' times using FilterList ?
Is the row filter from hbase (RowFilter) ?
What operator do you use (MUST_PASS_ALL or MUST_PASS_ONE) ?
For second question, I wonder how filter set would handle the constituent
filters differently from how FilterList handles
What happens if I insert the same row filter 'n' times? Would the table be
queried n times with the same row key?
Why is it that there is a filterList and not a filterSet?
Thanks & Regards
Biplob Biswas
