I'm reading the HBase book at
http://ofps.oreilly.com/titles/9781449396107/clientapisadv.html and I
have a question regarding pagination.
byte[] startRow = Bytes.add(lastRow, POSTFIX);
"Since the lexicographical sorting of the row keys by HBase and the
comparison taking care of finding the row keys in order, and the fact
that the start key on a scan in always inclusive, you need to add an
extra zero byte to the previous key. This will ensure that the last seen
row key is skipped and the next, in sorting order, is found. The zero
byte is the smallest increment and therefore safe to use when resetting
the scan boundaries. Even if there were a row that would match the
previous plus the extra zero byte the scan would be correctly doing the
next iteration - this is because the start key is inclusive."
What should be used as POSTFIX... ie how does one add a zero byte to an
existing key?
Thanks
