Search Engine Design
Date: 27 Jun 2002 14:04:57 GMT
Message-ID: <aff629$mlh$1_at_testinfo.cs.uoguelph.ca>
Hello all,
I have a few questions about designing a search engine. This will be much like a number of other search engines in which the search will be based on a number of keywords. As well an advanced search will allow the user to search by a number of criteria. So here is my main question:
What would be best:
1. To have one large table with all the keywords comma separated in one
column and then when a user searches it goes through the whole table
looking in the keyword column and parsing the list to see if it exists.
OR
2. In the keyword table have a list of all the URL's that match that keyword. So if the user is searching for computer then it goes to the keyword table finds the keyword computer and returns a list of all URL's that match.
The first way would be searching the whole table and the second requires the database to search the keyword table - which will be much smaller. There will possibly be up to 20,000 urls with 500 keywords - I just want to account for scalability.
Any help you be appriciated. If there is a better way or anyone has any suggestions or resources please reply.
Thanks in advance,
M
Received on Thu Jun 27 2002 - 16:04:57 CEST