From Plant your data in a ternary search tree More like this By Wally Flint The ternary search tree (TST) is the champion of data structure acrobatics -- it finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given pattern. You can easily search the tree for partial matches -- auto matches autograph, automatic, and so on. In addition, you can implement near-match functions, which gives you the ability to suggest alternatives for misspelled words -- e.g., impliment matches implement. A TST stores key-value pairs,
Read full article from Plant your data in a ternary search tree | JavaWorld
No comments:
Post a Comment