Hi,
You are right about this, I should have thought about it. There is just
one problem: A word can occur multiple times in the same documents, so the
table which gives the position of a word in a doc. must give all the
positions of the word. If we keep your logic, we would have to make a tab
If you want to make a LARGE (millions of documents, gigabytes of data)
searchengine, you'd better know something about searchengine algorithms :)
I'll give you one hint - A database is not a searchengine. A database is not
meant to be a searchengine. And, until some decent text-processing/searchi
where's the second option?
about your construction:
> We populate 2 tables:
> one containing the documents (text and ID)
> one containing all the words and the documents ID containing each word
how you plan to make 1 table with words, and several (unlimited)
document_ids?
what you'll need is:
1
