[Google] URL query with wild card

本文探讨了在包含数百万URL的索引中如何高效处理含有通配符(*)的查询问题,通过使用Trie树结构来实现对这类复杂查询的支持。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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...

转载于:https://www.cnblogs.com/codingtmd/archive/2013/02/03/5078905.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值