-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Pascal, et al --
...and then Pascal Francq said...
%
% Hi,
Hi!
% I have a question. I need to store documents (>100.000) and the word
% containing in them.
%
% They are two way to do the job :
[snip]
What about a third way? One table for the d
* Harald Fuchs
[...]
> 4) The documents are stored in a table 'docs' and identified by a 'docid'.
>The words are found by a FULLTEXT index.
The FULLTEXT feature is usefull if you don't need to search fast on 'words'
like C++, TCP/IP, IBM, XP, WIN, W2K etc. What these 'words' have in common,
is
* Pascal Francq
> I have a question. I need to store documents (>100.000) and the word
> containing in them.
>
> They are two way to do the job :
> 1°) The documents are stored in a table 'docs' and identified by
> an 'docid'. The words are then stored in a table 'docsbywords'
> where each pair (do
