I'm not sure what you want. I have post a solution to search for wildcards in tries. Now you claim to do it better with TS-Trees. Do you know who to compute a reverse TS-Tree? And why don't you try first to code a radix-tree, which is a compressed trie and build then the reverse radix-tree? Here is a solution to code a radix-tree, crit-bit- tree, pat-tree with mininmal understanding of comupter science:
> http://www.codeproject.com/KB/string/pat_and_huff.aspx IMHO I'm not sure why a Ternary-Search-Tree should be faster then a Radix-Tree? If a radix tree is already a binary-tree version of the trie, then can you explain me the advantage of a ternary-search-tree? On Aug 15, 8:31 pm, Amit Jaspal <amitjaspal...@gmail.com> wrote: > 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 <c...@linuxdna.com> 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 <amitjaspal...@gmail.com> 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 > > toalgoge...@googlegroups.com. > > To unsubscribe from this group, send email > > to>algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups > > .com> > > . > > 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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
