On Mon, 2011-11-28 at 11:05 -0600, Kevin Grittner wrote: > Joost Kraaijeveld <J.Kraaijeveld@xxxxxxxxxx> wrote: > > > This query goes faster (6224 ms, but I am not sure it gives the > > correct answer as the result differs from my Java program): > > It seems clear that you want to see words which appear with all > three types of files, but it's not clear what you want the count to > represent. The number of times the word appears in filetype 'n' > references (as specified in your second query)? The number of > permutations of documents which incorporate one 'f' document, one > 's' document, and one 'n' document (as specified in your first > query). Something else, like the total number of times the word > appears? I would like the answer to be "the number of times the word appears in all three the queries", the intersection of the three queries. -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl -- Sent via pgsql-performance mailing list (pgsql-performance@xxxxxxxxxxxxxx) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-performance
