> > I once started writing a small paper on this subject; it is still in a
> > rather preliminary state.
> > You can download the draft (and some ill documented code, 53kB) from
> > http://www.utdt.edu/~mig/sql-trees
i guess, with base 160 encoding there might be a problem: if postgres is
compiled with --enable-locale (e.g. for german umlauts), the ordering
isn't according to the ASCII number of the character, so for this
purpose it's needed to build the encoding table according to the locate
settings. Or simply sort it according the locale settings.
What's against using all characters >= 32, excluding special characters
with special meaninbg in LIKE and regexps? With base 208 encoding it's
possible to have 43264 elements on each level.
Alvar C.H. Freude | alvar(dot)freude(at)merz-akademie(dot)de
Demo: http://www.online-demonstration.org/ | Mach mit!
Blast-DE: http://www.assoziations-blaster.de/ | Blast-Dich-Fit
Blast-EN: http://www.a-blast.org/ | Blast/english
In response to
pgsql-sql by date
|Next:||From: Alvar Freude||Date: 2000-12-15 04:09:07|
|Subject: Re: Secure Messaging Non-Delivery Report: Re: How to represent a
tree-structure in a relationaldatabase|
|Previous:||From: Alvar Freude||Date: 2000-12-15 02:42:46|
|Subject: Re: How to represent a tree-structure in a relationaldatabase|