From: | Joost Kraaijeveld <J(dot)Kraaijeveld(at)Askesis(dot)nl> |
---|---|
To: | Kevin Grittner <Kevin(dot)Grittner(at)wicourts(dot)gov> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: PostgreSQL 9.1 : why is this query slow? |
Date: | 2011-11-28 17:23:02 |
Message-ID: | 1322500982.3343.30.camel@panoramix.Askesis.nl |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
On Mon, 2011-11-28 at 11:05 -0600, Kevin Grittner wrote:
> Joost Kraaijeveld <J(dot)Kraaijeveld(at)Askesis(dot)nl> 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
From | Date | Subject | |
---|---|---|---|
Next Message | Kevin Grittner | 2011-11-28 17:32:15 | Re: PostgreSQL 9.1 : why is this query slow? |
Previous Message | Kevin Grittner | 2011-11-28 17:05:20 | Re: PostgreSQL 9.1 : why is this query slow? |