Re: Performance of string deserialisation
- From: Helge Jensen <helge.jensen@xxxxxxx>
- Date: Tue, 06 Sep 2005 13:51:02 +0200
I can see in other threads on other groups that you are concerned about the performance of the read byte[]'s.
Please try the solution first, and verify -- using a profiler -- that your performance-problem is actually where you think it is.
If you need still more performance, you can checkout a data-structure called a "prefix-tree" which should give you some ideas to allow you to only store every read byte-sequence once, reading bytes one at a time.
However it is not certain that prefix-trees will benefit your performance, it all depends on the GC efficiency vs. your implementation of the data-structure you arrive at.
-- Helge Jensen mailto:helge.jensen@xxxxxxx sip:helge.jensen@xxxxxxx -=> Sebastian cover-music: http://ungdomshus.nu <=- .
- Follow-Ups:
- Re: Performance of string deserialisation
- From: drewnoakes
- Re: Performance of string deserialisation
- References:
- Performance of string deserialisation
- From: drewnoakes
- Re: Performance of string deserialisation
- From: Helge Jensen
- Performance of string deserialisation
- Prev by Date: Re: Performance of string deserialisation
- Next by Date: Massive Concurrency / Multiple ThreadPools
- Previous by thread: Re: Performance of string deserialisation
- Next by thread: Re: Performance of string deserialisation
- Index(es):