Re: Speeding up matching Strings in a set
- From: Mark Space <markspace@xxxxxxxxxxxxx>
- Date: Sat, 25 Oct 2008 19:09:56 -0700
softwarepearls_com wrote:
The setup costs of any matching approach are not relevant for my
application.. because the matching will be done a huge (10^[5..7])
number of times..
Considering this and your other post (the one talking about optimizing 68k programming), have you considered JNI? How about a database with some well choosen indexes? (How big is this set here?)
For JNI, you could possibly construct the HashSet first with Java, then export the internal arrays to JNI C structs. Then write some custom code to do the quick look-up.
Similar idea with using a database: eliminate as much Java as possible and use (presumably) faster code to do the work that needs optimizing.
.
- Follow-Ups:
- Re: Speeding up matching Strings in a set
- From: softwarepearls_com
- Re: Speeding up matching Strings in a set
- References:
- Speeding up matching Strings in a set
- From: softwarepearls_com
- Re: Speeding up matching Strings in a set
- From: Lew
- Re: Speeding up matching Strings in a set
- From: Robert Klemme
- Re: Speeding up matching Strings in a set
- From: Robert Klemme
- Re: Speeding up matching Strings in a set
- From: Christian
- Re: Speeding up matching Strings in a set
- From: softwarepearls_com
- Speeding up matching Strings in a set
- Prev by Date: Re: Speeding up matching Strings in a set
- Next by Date: Re: Memory allocation time
- Previous by thread: Re: Speeding up matching Strings in a set
- Next by thread: Re: Speeding up matching Strings in a set
- Index(es):
Relevant Pages
|