From: | Oleg Bartunov <oleg(at)sai(dot)msu(dot)su> |
---|---|
To: | hannu(at)krosing(dot)net, Teodor Sigaev <teodor(at)stack(dot)net> |
Cc: | dhogaza(at)pacifier(dot)com, Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | new contrib/tree, 65535 children ! |
Date: | 2002-02-06 17:47:53 |
Message-ID: | Pine.GSO.4.44.0202062032470.7400-100000@ra.sai.msu.su |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Hi,
we're about to release new version of contrib/tree available from
http://www.sai.msu.su/~megera/postgres/gist/tree/tree.tar.gz
Brave could test it, very sparse doc is in README.tree (in russian).
The basic idea is to represent node by path from root,
so '3.4' means 4-th child of 3-rd child of the root.
We introduce two types for handling trees:
entree (enumerated tree) and bitree (bit tree).
bitree is actually what we already used in previous version
and has limitation on number of children, specified in compilation -
8,16,32(on default),64.
This limitation and discussion in mailing list (Hanny, Don) inspired us to
implement another type - 'entree', which has maximum number of
children - 65535 !!! Thanks Eugeny Rodichev for fruitful discussion.
We have tested the module with 7.2 release.
Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg(at)sai(dot)msu(dot)su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83
From | Date | Subject | |
---|---|---|---|
Next Message | Andrew McMillan | 2002-02-06 18:41:38 | Re: Management tool support and scalibility |
Previous Message | Peter Eisentraut | 2002-02-06 16:14:49 | Re: i18n |