On 19/10/16 13:15, Matheus de Oliveira
wrote:
On Wed, Oct 19, 2016 at 8:54 AM,
negora <pub...@negora.com>
wrote:
Nested Loop (cost=245.92..383723.28 rows=7109606
Hello:
I've a question about the performance of a query plan that uses a nested
loop, and whose inner loop uses an index scan. Would you be so kind to
help me, please?
I'm using PostgreSQL 9.5.4 on Ubuntu 14.04 64-bit (kernel 4.8.2). I've 3
tables, which are "answers", "test_completions" and "cou
ight return the entire result to my external
Java application (I was using a similar approach on it too). I just
hope that the speed of that single SQL compensates the transfer of such
a big mass of data between PostgreSQL and Java in terms of delay.
Thanks ;) .
Kevin Grittner wrote:
for extending this topic too much.
Scott Carey wrote:
On Feb 23, 2010, at 8:53 AM, Alvaro Herrera wrote:
negora wrote:
According to how I understood the process, the engine would get the
name from the student with ID 1 and would look for the name of the
father with ID 1 in the hashed ta
tilize" the name)? Or would it search into the hashed table again?
Thanks a lot for your patience :) .
Kevin Grittner wrote:
negora wrote:
I've a doubt about how the PostgreSQL planner makes a hash join.
Let's suppose that I've 2 tables,
Hello:
I'm an ignorant in what refers to performance analysis of PostgreSQL.
I've a doubt about how the PostgreSQL planner makes a hash join. I've
tried to "dig" into the archive of this mailing list but I haven't found
what I'm looking for. So I'm explaining my doubt with an example to see
if an
Hello:
I'm an ignorant in what refers to performance analysis of PostgreSQL.
I've a doubt about how the PostgreSQL planner makes a hash join. I've
tried to "dig" into the archive of this mailing list but I haven't found
what I'm looking for. So I'm explaining my doubt with an example to see
i
