Maybe you could wrap the keys in a WritableComparable object that
combines the key with an integer, so you have something like:
( [k1, 0], v1 )
( [k1, 1], v2 )
( [k1, 2], v3 )
Then when you want to read the values for k1, look for [k1, 0], and
keep reading until the key is no longer k1.
On
Great idea!!! Thank you so much!!!
Best wishes,
Feng
On 11/28/06, Albert Chern [EMAIL PROTECTED] wrote:
Maybe you could wrap the keys in a WritableComparable object that
combines the key with an integer, so you have something like:
( [k1, 0], v1 )
( [k1, 1], v2 )
( [k1, 2], v3 )
Then when
Albert Chern wrote:
Every time the size of the map file hits a multiple of the index
interval, an index entry is written. Therefore, it is possible that
an index entry is not added for the first occurrence of a key, but one
of the later ones. The reader will then seek to one of those instead
