开发者

How can I store data in a table as a trie? (SQL Server)

To make things easier, the table contains all the words in the English dictionary.

What I would like to do is be able to store the data as a trie. This way I can traverse the different branches of the trie and return the most relevant result.

First, how do 开发者_开发问答I store the data in the table as a trie?

Second, how do I traverse the tree?

If it helps at all, the suggestion in this previous question is where this question was sparked from.

Please make sure it's SQL we're talking about. I understood the Mike Dunlavey's C implementation because of pointers but can't see how this part (The trie itself) works in SQL.

Thanks,

Matt


You model your data hierarchies with SQL Server 2008 using hierarchy id. See this MSDN magazine reference.


I don't think you need to implement Trie in DB. You can simply use like %~word% query and it would work exactly the same. I don't know your reason for trying to implement Trie in DB but it sounds quite inefficient.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜