IWETHEY v. 0.3.0 | TODO
1,095 registered users | 0 active users | 0 LpH | Statistics
Login | Create New User
IWETHEY Banner

Welcome to IWETHEY!

IWETHEY Home / IWETHEY Board / Theory and Practice of Programming Forum / Build time is once every 3 months
Post #328,443
by crazy
6/23/10 10:37:44 AM
Reply
New Build time is once every 3 months
If that.

Lookup speed is where I'll put my effort.
Post #328,447
by jake123
6/23/10 10:54:45 AM
Reply
New If space is not an issue but speed is
use a trie. It's a compressed tree. Depending on how long the word you're using for the index is, you will get to it in time k where k equals word.length.
     Goal: Really Fast File Lookup - (crazy) - (11) - June 22, 2010, 12:40:54 PM EDT
         Brute force - (drook) - (1) - June 22, 2010, 12:57:01 PM EDT
             No wetware in the budget. -NT - (crazy) - June 22, 2010, 01:01:22 PM EDT
         Use memcached - (folkert) - (1) - June 22, 2010, 04:34:21 PM EDT
             Not yet - (crazy) - June 23, 2010, 09:07:49 AM EDT
         Map/Reduce? - (malraux) - (3) - June 22, 2010, 11:38:06 PM EDT
             Pretty much, but in a simpler form - (crazy) - (2) - June 23, 2010, 09:07:07 AM EDT
                 Something like this maybe - (malraux) - (1) - June 23, 2010, 12:26:12 PM EDT
                     Life just got easy - (crazy) - June 23, 2010, 04:28:55 PM EDT
         Can you combine methods? - (drook) - (2) - June 23, 2010, 10:15:37 AM EDT
             Build time is once every 3 months - (crazy) - (1) - June 23, 2010, 10:37:44 AM EDT
                 If space is not an issue but speed is - (jake123) - June 23, 2010, 10:54:45 AM EDT

Hello, boys and girls, this is your old pal Stinky Wizzleteats!
73 ms