If using a trie just as a set, not for 'startsWith' queries, can permute keys based on entropy of each position for faster lookup
-
@djspiewak I mean entropy of the position. That is, if all keys in trie start w/ letter 'a', entropy of that position is 0.
@pchiusano @djspiewak More generally, you compiling an optimised hash function for a given keyset. I've also thought this is a good idea.
-
-
@propensive@djspiewak Nice thing about trie approach is it works for keys (or queries) containing wildcards, not sure about hashing -
@pchiusano@propensive Hashing works well with prefix hashing. That’s the foundation of Bagwell’s hash tries.
End of conversation
New conversation -
-
-
@propensive@pchiusano It’s even better than that, actually. You’re *incrementally* inferring and compiling an optimized hash function.Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.