From: | David Hoksza <david(dot)hoksza(at)seznam(dot)cz> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: type of b-tree |
Date: | 2006-07-23 20:35:35 |
Message-ID: | 1816336848.20060723223535@seznam.cz |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
OK, thanks. And I would like have one more question about B-tree index
- how many records are usualy stored in one node (what's arity of the tree)?
Thanks,
David Hoksza
________________________________
23. července 2006, 20:03:03, napsal jste:
TL> David Hoksza <david(dot)hoksza(at)seznam(dot)cz> writes:
>> Hi, could anybody tell me which variation of B-tree PostgreSQL uses, that
>> it can handle more than one column?
TL> Plain old b+ tree ... we just treat the keys as compound, ie the
TL> "compare" operation compares columns until finding a difference.
>> Some link would be great.
TL> Use the source Luke ...
TL> http://developer.postgresql.org/cvsweb.cgi/pgsql/src/backend/access/nbtree/
TL> regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Michael Fuhr | 2006-07-24 02:42:10 | Re: Error dumping and restoring postgis db |
Previous Message | Claire McLister | 2006-07-23 18:22:18 | Error dumping and restoring postgis db |