Skip site navigation (1) Skip section navigation (2)

Re: SQL99 Hierarchical queries

From: Mike Benoit <ipso(at)snappymail(dot)ca>
To: Evgen Potemkin <eugen(dot)potemkin(at)gmail(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: SQL99 Hierarchical queries
Date: 2005-02-28 20:02:55
Message-ID: (view raw, whole thread or download thread mbox)
Lists: pgsql-hackers
I'm curious what kind of performance differences there would be over
using something like the nested-set model?

Would this be faster, or slower?

On Thu, 2005-02-24 at 13:02 +0300, Evgen Potemkin wrote:
> Hi hackers!
> I have done initial implementation of SQL99 WITH clause (attached).
> It's now only for v7.3.4 and haven't a lot of checks and restrictions.
> It can execute only simple WITH queries like
> WITH tree AS (SELECT id,pnt,name,1::int AS level FROM t WHERE id=0
> UNION SELECT,t.pnt,,tree.level+1 FROM t JOIN tree ON
> ) SELECT * FROM tree;
> It would be great if someone with knowledge of Pg internals can make a
> kind of code review and make some advices how to better implement all
> this.
> Regards, Evgen.
> ---------------------------(end of broadcast)---------------------------
> TIP 3: if posting/reading through Usenet, please send an appropriate
>       subscribe-nomail command to majordomo(at)postgresql(dot)org so that your
>       message can get through to the mailing list cleanly
Mike Benoit <ipso(at)snappymail(dot)ca>

In response to

pgsql-hackers by date

Next:From: Pavel StehuleDate: 2005-02-28 20:08:21
Subject: Re: SQL99 Hierarchical queries
Previous:From: Tom LaneDate: 2005-02-28 19:51:46
Subject: Re: snprintf causes regression tests to fail

Privacy Policy | About PostgreSQL
Copyright © 1996-2017 The PostgreSQL Global Development Group