From: Christian Rishoej <chrris@mail.dk>
To: Christopher Kings-Lynne <chriskl@familyhealth.com.au>
To: pgsql-sql@postgresql.org
Subject: Re: Optimizing the implementation of an optimized tree
Date: 07 May 2002 13:03:19 +0200
Message-ID: <1020769399.889.10.camel@penelope.dyndns.dk> (raw)
In-Reply-To: <GNELIHDDFBOCMGBFGEFOGEHJCCAA.chriskl@familyhealth.com.au>
References: <GNELIHDDFBOCMGBFGEFOGEHJCCAA.chriskl@familyhealth.com.au>
On Tue, 2002-05-07 at 04:00, Christopher Kings-Lynne wrote:
> Why not try Oleg and Teodor's tree module?
>
> http://cddb.sai.msu.su/~megera/postgres/gist/
>
> You have to expend a little effort in implementing it as the README's in
> Russian :) Still has examples tho.
As far as I can tell Oleg and Teotor are doing *balanced* trees, and not
trees usable for containing a hiearchy of nodes where each node can have
0-N children.
It is my understanding that I cannot rely on the organization of a
balanced tree - hence the name "balanced" (nodes are inserted where some
algotithm thinks it fits in, not where I want it. Imagine if your
directory-hiearchy on your filesystem was a balanced tree...).
Does anyone have a clue on how to optimize triggers? Can I use another
language than PL/PGSQL? Would C be crazy when I do lots of SQL's and no
calculation in the trigger?
Christian
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients using the --to and --cc options:
reply via email
To: pgsql-sql@postgresql.org
Cc: chrris@mail.dk, chriskl@familyhealth.com.au
Subject: Re: Optimizing the implementation of an optimized tree
In-Reply-To: <1020769399.889.10.camel@penelope.dyndns.dk>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox