本文探讨了在包含数百万URL的索引中如何高效处理含有通配符(*)的查询问题。通过使用Trie数据结构来实现对这类特殊查询的支持，确保能够快速找到匹配的URL并展示给用户。
In our indexes, we have millions of URLs each of which has a link to the
page content, now, suppose a user type a query with wild cards *, which
represent 0 or multiple occcurrences of any characters, how to build the
index such that such a type of query can be executed efficiently and the
contents of all correpsonding URLs can be displayed to the users? For
example, given a query http://www.*o*ve*ou.com. You man need to find iloveyou.com, itveabcu.com, etc.
[Thoughts]
use a Trie and traverse through are trie and for each * traversing to all the children of the node…
扫一扫
202
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
