Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I was a heavy user in Sphinx and Lucene.
Sphinx just takes a database, indexes it. And you call Sphinx to get the ID’s.
But what if I want to create a search engine that’s very tiny. Just a few rows of data and a few paragraphs of words? The trick is, the rows of data is constantly changing. So, I can’t have an “index”.
I want to be able to rank by relevancy, just like Sphinx. How can I do that?
Of course, I wouldn’t go through the indexing…
If you only have a few rows of data and a few paragraphs of words in each, keep it all in memory and use whatever text algorithm makes the most sense for your content.