I have not been able to download the document for the last day and a
half... Can someone please forward a copoy to me if you have one???
Thanks,
Gurjeet.
On 6/20/06, Chris Smith <[EMAIL PROTECTED]> wrote:
Thanks for everyone's suggestions. I found the following, which at least
seems to meet my
Thanks for everyone's suggestions. I found the following, which at least
seems to meet my needs temporarily.
http://citeseer.ist.psu.edu/dong99maintaining.html
Should it turn out that this is not feasible to implement via triggers in
PostgreSQL, I may be back with more questions and seek o
There was a thread last November entitled "Transitive closure of a
directed graph" on the [HACKERS] list. There may be some information of
use there.
---(end of broadcast)---
TIP 9: In versions below 8.0, the planner will ignore your desire to
Oleg Bartunov wrote:
Chris,
have you seen contrib/ltree ?
I hadn't. Thanks! I will look into it further, but I'm currently a bit
concerned by the word "tree" in the title. Many of the problems I'm solving
are not trees, though nearly all are DAGs.
--
Chris Smith - Lead Software Develope
On Mon, Jun 19, 2006 at 13:43:17 -0600,
Chris Smith <[EMAIL PROTECTED]> wrote:
> I am doing some preliminary work on the next major release of a piece of
> software that uses PostgreSQL. As odd as this sounds, it seems that a huge
> percentage of the new features that have been requested invol
Chris,
have you seen contrib/ltree ?
Oleg
On Mon, 19 Jun 2006, Chris Smith wrote:
I am doing some preliminary work on the next major release of a piece of
software that uses PostgreSQL. As odd as this sounds, it seems that a huge
percentage of the new features that have been requested involv
I am doing some preliminary work on the next major release of a piece of
software that uses PostgreSQL. As odd as this sounds, it seems that a huge
percentage of the new features that have been requested involve computing
the transitive closure of a binary relation that's expressed in a databas