Seems a gud idea . I have read we can do better with Ternary Search Trees .Can anybody has any idea about it?
On Sun, Aug 15, 2010 at 11:44 PM, Chi <[email protected]> wrote: > What you may need is a reverse trie. You may take a look at this: > > > http://phpir.com/tries-and-wildcards > > On Aug 15, 3:21 pm, amit <[email protected]> wrote: > > In our indexes, we have millions of URLs each of which has a link to > > some page contents, that is, URL->contents. Now, suppose a user types > > a query with wild cards *, which represent 0 or multiple occurrences > > of any characters, how do you build the indexes such that such a type > > of query can be executed efficiently by finding all corresponding > URLs->contents efficiently. For example, given a queryhttp://www.*o*ve* > ou.com. > > > > You need to find iloveyou.com, itveabcu.com, etc. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Amit Jaspal Btech IT IIIT- Allahabad -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
