Re: Query optimizing - paradox behave

From: Stephan Szabo <sszabo(at)megazone23(dot)bigpanda(dot)com>
To: "David M(dot) Richter" <D(dot)Richter(at)DKFZ-heidelberg(dot)de>
Cc: pgsql-sql(at)postgresql(dot)org
Subject: Re: Query optimizing - paradox behave
Date: 2001-07-19 15:12:24
Message-ID: Pine.BSF.4.21.0107190810000.35685-100000@megazone23.bigpanda.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql


What version are you using? (dbPG95GetIndex?)

On Thu, 19 Jul 2001, David M. Richter wrote:

> Hallo !
>
> I want to tune a database. There a many redundant datas in the database
> , because of all the relations were consider as n:m relations. But the
> most of them are 1:n Relations. So my approach was to cut the
> redundancies to get more performance. But .. happens!
>
> The query with the 3 tables is faster than the query with 2 tables.
>
> That is paradox to the Explain output.
> And: the real database functions like dbPG95GetIndex and all functions
> defined by me are slower.

In response to

Responses

Browse pgsql-sql by date

  From Date Subject
Next Message Josh Berkus 2001-07-19 15:19:55 Re: pl/pgsql - code review + question
Previous Message David M. Richter 2001-07-19 10:20:41 Query optimizing - paradox behave