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

Re: running aggregates entirely in SQL?

From: Josh Berkus <josh(at)agliodbs(dot)com>
To: Brian Ghidinelli <brian(at)pukkasoft(dot)com>, sfpug(at)postgresql(dot)org
Subject: Re: running aggregates entirely in SQL?
Date: 2004-05-11 19:31:10
Message-ID: 200405111231.10963.josh@agliodbs.com (view raw or flat)
Thread:
Lists: sfpug
Brian,

> On the Celko note - has anyone implemented his nested tree model?  It's 
> really great for arbitrarily deeply nested hierarchies.

I have.   I find it really, really fast for "in branch" queries (which other 
trees suck at) but really, really slow to update.  So it's  a good model for 
a tree which will be modified, say, once every 10,000 reads.

-- 
-Josh Berkus
 Aglio Database Solutions
 San Francisco


In response to

Responses

sfpug by date

Next:From: Josh BerkusDate: 2004-05-11 19:35:30
Subject: Re: running aggregates entirely in SQL?
Previous:From: David FetterDate: 2004-05-11 18:43:36
Subject: Re: running aggregates entirely in SQL?

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