On Thu, Dec 30, 2010 at 11:50 PM, Robert Haas wrote:
> On Thu, Dec 30, 2010 at 10:45 AM, Tom Lane wrote:
> > I had an epiphany about this topic, or actually two of them.
> >
> > 1. Whether or not you think there's a significant performance reason
> > to support hash right joins, there's a functi
On Wed, Dec 29, 2010 at 3:58 PM, Simon Riggs wrote:
> On Wed, 2010-12-29 at 09:59 -0500, Tom Lane wrote:
> > Robert Haas writes:
> > > On Wed, Dec 29, 2010 at 7:34 AM, Simon Riggs
> wrote:
> > >> It's not a bug, that's the way it currently works. We don't need a
> test
> > >> case for that.
> >
Hi,
Please see the following plan:
postgres=# explain select * from small_table left outer join big_table using
(id);
QUERY PLAN
Hash Left Join (cost=126408.00..142436.98 rows=371 width
On Thu, Dec 23, 2010 at 10:26 AM, Tom Lane wrote:
> Kenneth Marshall writes:
> > On Thu, Dec 23, 2010 at 10:42:26PM +0800, Li Jie wrote:
> >> But in the last query that sorts on "id", since the query selects all
> the columns for output, the actual sorted size is the same, and the only
> differ
Hi,
Here is the test table,
postgres=# \d big_wf
Table "public.big_wf"
Column | Type | Modifiers
+-+---
age| integer |
id | integer |
postgres=# \dt+ big_wf
List of relations
Schema | Name | Type | Owner | Size | Description
Hi all,
I'm new to window functions. Recently I run some simple queries but
surprised to find percent_rank is so slower than rank, could anybody tell me
why?
The table schema:
test=# \d inventory1
Table "public.inventory1"
Column| Type | Modifiers
-
