[sword-devel] Fast search?

Joachim Ansorg sword-devel@crosswire.org
Wed, 27 Sep 2000 22:02:53 +0000

Hi Nathan!

Glad to have you on this list!

> Good day Joachim
> The algorithms are actually not very difficult at all. :) I will
> (Lord willing) try to write the algorithms in a generic C-like
> format. Then you should be able to easily and quickly port it to
> the language of your choice. I used to work with C, and have not
> used C++ much, so I will not be able to efficiently implement these
> algorithms in Sword. I will leave that to Troy and yourself to do
> this (if you don't mind). Unless someone else volunteers?

I could try, but I'm not a very good coder (maybe too lazy to learn more 
lo-level stuff ;)

> The benchmarks for some of the searches I have done indicate that the
> response time is sub-second, even for complex searches with wildcards!
> (On a 600 MHz P3... :)

Now make a backup of your hard drive so we'll not loose our fast search ;)
Does this also include searches with large result sets?

> I am currently investigating the best way to compress the index file.
> The decompression could still influence the response time, but it will
> not be much.

This is great!

> The other outstanding issue is to efficiently implement "exact phrase"
> searches (which is in progress).

> *** I still need some answers to the questions I asked a while ago (17/9)

Done. Sent an answer to yor eMail.

> --> How small do we really want the fast search index file?
> --> Will it replace the current search, or just be an additional option?
> --> What is expected from the fast search?
> Feedback anyone?