After discussion and more tests in the Slide group I have abandoned
the approach.
All this does not work for realistic scenarios and realistic sizes.
Main problem is that if the keys do not share much common prefixes the
size of states gets enormously and impracticably high.
Sources still can be
Hi,
I've not fully understood what this is good for. I thought the main problem is to
invalidate/remove subtrees in a cache.
This could be achieved quit simple, doesn't it?
Or have I missed something...
Cheers,
Daniel
Jakarta Commons Developers List [EMAIL PROTECTED] schrieb am 27.10.04
Having groups you can invalidate? Or anything else? Groups would work,
I more or less persued this for fun...
Oliver
On Wed, 27 Oct 2004 22:09:23 +0200, Daniel Florey [EMAIL PROTECTED] wrote:
Hi,
I've not fully understood what this is good for. I thought the main problem is to
Folks,
while thinking about cache invalidation strategies in the Slide
project a long abandoned idea come back to my mind: a DFA based map
for String keys only! When I implemented a scetch of this once it
turned out to be slower in all respects than hash maps. These are my
old measurements:
DFA:
