What Ryan said plus see inline. J-D
On Fri, Mar 5, 2010 at 6:37 PM, Otis Gospodnetic <otis_gospodne...@yahoo.com> wrote: > Hmmmm.... no. I'm wondering if there is a way to first *jump* to a row with > a given key and then scan to the end from there. > For example, imagine keys: > ... > 777 > 444 > 222 > 666 > > And imagine that some job went through these rows. It got to the last row, > row with key 666. This key 666 got stored somewhere as "this is the last key > we saw". > After that happens, some more rows get added, so now we have this: > ... > 777 > 444 > 222 > 666 <=== last seen > 333 > 999 > 888 But how would you do that since the row keys are ordered lexicographically? What you described is easily doable if using a timestamp as the first component of the row key + using http://hadoop.apache.org/hbase/docs/r0.20.3/api/org/apache/hadoop/hbase/client/Scan.html#setStartRow(byte[])
