in reply to Inefficient search algorithm?

Thank you for the help so far.

First of all, if I could make an indexing system that would be great :P However, this is just a small project for the University and I dont have many hours to spend on this project, so I think it would be overkill to make something that complicated. Ive only been working on it for a few days, and its pretty much done except for the 'too many matches' problem. Not to mention, most of the work was converting the database from Access to Microsoft SQL.

As for the slicing, I was thinking of having SQL order the results by number of hits, that way if you click on "See results 20-29" I could just tell SQL to give me 20-29 of the ordered results. Im not sure if that is how LIMIT would work, wouldnt LIMIT just give me a number of results less than the limit?

Ill take a look at that article and the free search engines and see if I can persue that end. However, is everyone pretty much sure I am asking to do the impossible in SQL?

*edit: As for new articles, at any time Publications can hand us a new updated Access Database, and I have to write the tools that will auto update the Microsoft SQL database, so my application actually has to allow for new articles to be published. I have to make them easy to use too, as the few people in the office that know perl might be gone one day as we are student employees.