3 ms·
Not so instant for me :-P
by ivankirigin 19y ago
Not so instant for me :-P
- paulgb 19y agoI found the same. You must be using LIKE across the whole dataset? Why not build a hash table with every two-letter combination as they keys and the index of every word containing that combination as the value? That should narrow down the number of words you have to search through for each query, and it could all be done in MySQL with a many-to-many relation.
- kirubakaran 19y agoI use a text file (not db). I too thought that partitioning it would give a better performance. But profiler disagreed. I use nearlyfreespeech.net, and they don't support FastCGI yet. Thats the bottleneck. I am planning to try this in EC2... to see what happens.
- kirubakaran 19y agoIt is much faster now.