| From: | "Cris" <cris(at)dmcid(dot)net> |
|---|---|
| To: | pgsql-general(at)postgresql(dot)org |
| Subject: | How many levels a B-tree has? |
| Date: | 2003-05-14 17:09:54 |
| Message-ID: | 200305141609.h4EG9sG27003@cancerberus.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
Hi,<BR>[I'm not sure if this will be the best word to express the thing I
mean, because I've been reading some papers, and mail archives that have
been looked for by this word, and I haven't got any result, so I would do my
best.]<BR><BR>I need to know (if it possible) how many LEVELS a B-tree index
has (to know how many accesses to the disk it would do in a query). I could
know the index size, but no-idea to find out how many levels it has.
I've read about pg_index, but there isn't any about.<BR>There is any way to
do it?<BR><BR>Thanks<BR><BR>Cris..<BR>
| Attachment | Content-Type | Size |
|---|---|---|
| unknown_filename | text/html | 568 bytes |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Forest Wilkinson | 2003-05-14 17:12:41 | Re: fomatting an interval (resend) |
| Previous Message | Richard Welty | 2003-05-14 17:07:08 | Re: - what protocol for an Internet postgres |