Re: [HACKERS] Another reason to redesign querytree representation

From: Thomas Lockhart <lockhart(at)alumni(dot)caltech(dot)edu>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: pgsql-hackers(at)postgreSQL(dot)org
Subject: Re: [HACKERS] Another reason to redesign querytree representation
Date: 1999-07-20 05:18:48
Message-ID: 379406B8.46AEFB00@alumni.caltech.edu
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

> Maybe it is time to swallow hard and redesign the querytree
> representation? I think we really need a multi-level-plan
> data structure right out of the starting gate... a format
> closer to the plantree structure that the executor uses would
> probably be less trouble all around.

Well, while you do that keep in mind outer joins. We've been
discussing it, and it is pretty clear that rte's cannot hold the join
info, since the same source table can participate in more than one
join. So we might have to carry the info in a special kind of
qualification node, which allows the planner/optimizer to generate
subselects below and above that node, but does not allow it to try the
full range of different combinations of joins across it (since it
appears to me that outer joins have only limited possibilities for
rearrangement of the query).

But perhaps a redesigned querytree could carry the info more
naturally...

- Thomas

--
Thomas Lockhart lockhart(at)alumni(dot)caltech(dot)edu
South Pasadena, California

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Vadim Mikheev 1999-07-20 05:41:00 Re: [HACKERS] Lots of things happening
Previous Message Thomas Lockhart 1999-07-20 05:10:59 Re: [PORTS] RedHat6.0 & Alpha