algorithm - Optimal physical orderings of nodes -

first, read this:
tpt paper
wondering other options might exist arranging nodes boost performance. post-parent order in byte array, tpt's, more k-order b-tree; i'm wondering options known @ moment?

a bit more on problem:
have extremely fast way of finding elements within sparse set, given concept of adjacency given pointer. wondering how best take advantage of in storing patricia trie.

you can make assumptions whether trie random-access, read only, write-seldom, or add-only. please note them if do, i've used tpt , gains pretty significant i'm willing consider constraints.

update

i guess in senses little unclear. i'm looking here ways of arranging things in memory optimize 1 performance metric or another. tpts, through tricks, use node order optimize disk reads , space-per-node. i'm curious about:

total deletion, structure removed memory entirely.
inserts, particularly in densely populated structures.
deletes, again, particularly in densely populated structures.

a dawg or minimal dfa (see this question or paper "how squeeze lexicon") may better tpt because totel size smaller.