Subj : Re: Serializing a trie (sorting problem)
To   : comp.programming
From : 3rdtry
Date : Mon Jul 25 2005 04:54 pm

Can you be more specific about the performance needed for each
operation?  I assume you want fastest possible lookup on prefix matches
if you're using a trie.

The problem is that compression and access speed are somewhat inverse
to each other.

You might try locating nodes according to which character reaches them;
eg all the A's first, then B's, etc.  You can then omit the character
for each node and just look it up.

An added benefit is that each node's child pointers will be in
ascending order.

.