[concurrency-interest] RE: Concurrency-interest Digest, Vol 9, Issue 14

Remi Forax forax at univ-mlv.fr
Mon Oct 24 03:46:06 EDT 2005

Doug Lea wrote:

> Hu, Jinsong wrote:
>>  the first time the
>> DataBlock is loaded from disk, I will build up hash index for them,
>> if a request for range query coming in, I first use hashing to find
>> the correct element, then calling geNext() one by one to get the
>> range result. I think a navigable LinkedHashMap is the answer.
> See rfe 6266354 
> http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=6266354
> which is probably also what you want.

My to cents, at least that 6182958 and 4848853 are related too.

> This won't be in Mustang, but you can vote for it for Dolphin :-)
> -Doug
Rémi Forax

More information about the Concurrency-interest mailing list