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

Re: contrib/tree

From: Hannu Krosing <hannu(at)krosing(dot)net>
To: Oleg Bartunov <oleg(at)sai(dot)msu(dot)su>
Cc: dhogaza(at)pacifier(dot)com, Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: contrib/tree
Date: 2002-01-25 19:38:50
Message-ID: 1011987530.2371.2.camel@rh72.home.ee (view raw, whole thread or download thread mbox)
Thread:
Lists: pgsql-hackers
On Sat, 2002-01-26 at 00:17, Oleg Bartunov wrote:
> Don,
> 
> does your approach handle directed graphs ( DAG ) ?
> Actually our module is just a result of our research for new
> data type which could handle DAGs ( yahoo, dmoz -like hierarchies)
> effectively in PostgreSQL.

Why not use intarray's instead of (n=6)bit-arrays?

Is it just space savings ( 64(0) of anything is enough ;) ) or something
more fundamental ?

> While we didn't find a solution we decided to release this module
> because 64 children would quite ok for many people.
> Of course, 128 would be better :-)

4294967296 would be enough for almost everybody :)

> How about 'move' operation in your approach ?

I have not looked at his code long enough but it seems to still need
replacing all child nodes bitarray tails ...

--------------
Hannu


In response to

Responses

pgsql-hackers by date

Next:From: Vince VielhaberDate: 2002-01-25 20:24:10
Subject: sequence indexes
Previous:From: Oleg BartunovDate: 2002-01-25 19:17:34
Subject: contrib/tree

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