Re: optimizing large query with IN (...)

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: "scott(dot)marlowe" <scott(dot)marlowe(at)ihs(dot)com>, "Marcus Andree S(dot) Magalhaes" <marcus(dot)magalhaes(at)vlinfo(dot)com(dot)br>
Cc: <pgsql-performance(at)postgresql(dot)org>
Subject: Re: optimizing large query with IN (...)
Date: 2004-03-12 17:39:18
Message-ID: 200403120939.18797.josh@agliodbs.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Marcus,

> The problem, as I understand it, is that 7.4 introduced massive
> improvements in handling moderately large in() clauses, as long as they
> can fit in sort_mem, and are provided by a subselect.

Also, this problem may be fixed in 7.5, when it comes out. It's a known
issue.

--
Josh Berkus
Aglio Database Solutions
San Francisco

In response to

Browse pgsql-performance by date

  From Date Subject
Next Message Greg Stark 2004-03-12 18:00:33 Re: severe performance issue with planner
Previous Message Stephan Szabo 2004-03-12 06:09:16 Re: Sorting when LEFT JOINING to 2 same tables, even