| From: | Joerg Hessdoerfer <Joerg(dot)Hessdoerfer(at)sea-gmbh(dot)com> |
|---|---|
| To: | pgsql-general(at)postgresql(dot)org |
| Subject: | Universal B-trees... |
| Date: | 2001-01-15 09:35:39 |
| Message-ID: | 5.0.2.1.0.20010115103006.00a98640@192.168.0.1 |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
Hi!
I just came across an interesting article in a german PC-Mag, covering use
of universal B-trees for indexing multi-index databases. Looks VERY
promising, indeed.
I dunno if that could be implemented in postgreSQL, or is of any interest
at all, but here's an URL for anyone ineterested: http://mistral.in.tum.de
They have set up a nice web page showing the ins and outs of the
algorithms, and nice presentations.
As a plus, the results they had seem VERY good...
Greetings,
Joerg
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Poul L. Christiansen | 2001-01-15 10:11:02 | Re: exporting table to txt |
| Previous Message | Dan Langille | 2001-01-15 08:39:46 | Re: getting number of rows updated within a procedure |