Re: "Google Like" with weighted searches project
- From: "John A. Bailo" <jabailo@xxxxxxxxxx>
- Date: Mon, 12 Dec 2005 16:44:23 -0800
DQ dont quit wrote:
I'm currently working on a ASP.Net / C# / SQL 2000 project that involves the entering of keywords, that a web user enters, and then searching MSWord documents for those words.
Good project.
This information will then be used to perform weighted searches on the keywords and text of multiple MSWord documents. How might this best be accomplished? Should I perform Full Text Searches on the Word files or store the data in a database (by coping and pasting the document into a Web app page)?
What would be cool is to copy each word, word by word, into a database, assigning it an integer as to it's place in the document and some other information that would be useful in searching ( page number, paragraph number ) and so on.
So, you would create a Text-Search based object model that would be based on the atomic unit in the database, which consists of all the words (not many words bigger than 255 that I know of!) and a clustered index of the place in the document where the word is.
Then you would make a table of noise words, a table of similar words ( singular mapped to plural).
Ok, so then, you would do a fast search by finding all the words, then grabbing the place, and offering the list to the user. Then, you would make an interface to move the user to the place inside the document.
If I store it in a database, how would I
store more than 255 characters and then be able to do searches on specific words? Thanks in advance for your reply!
.
- Prev by Date: Seeking NNTP Classes.....
- Next by Date: Re: Select Max Value
- Previous by thread: Re: "Google Like" with weighted searches project
- Next by thread: How do you manage a project branch when 3rd party library versions change?
- Index(es):
Relevant Pages
|
