Hello, well it does trade memory for speed, but it...

2011-03-18T08:49:06.754+13:00

Hello, well it does trade memory for speed, but it can handle very large lists and long text fine. You should test the performance and memory usage yourself to make sure it fits your needs.

As for your other question, I am wondering why you want that in JS, amybe better for serverside component? You probably want symmetric relationships (eg ball -> pool) so its time to get reading about data structures..

Thanks for UFD... I am about to use it in a projec...

2011-03-17T23:36:01.143+13:00

Thanks for UFD...
I am about to use it in a project of mine.

Very Nice, whats the memory usage like for lists with long descriptions?

I am thinking of using this approach to reverse keyword lookups.

So if we have categories, and hundreds of keywords which are associated...

Sea = trout,salmon,shark,hammer-head,sting,ray
Pool = shark,ball
Animal = koala,bear,cat,dog,party,dirty

Now if I have an input which takes in a keyword i.e. shark

I would want it to return Pool, and Sea

Would the trie approach be an effective mechanism?

If not, any suggests for good algorithms in Javascript?

Comments on Toolman in the Toyshop of the World: Infix search using a Trie data structure

Hello, well it does trade memory for speed, but it...

Thanks for UFD... I am about to use it in a projec...