Oracle FAQ | Your Portal to the Oracle Knowledge Grid |
![]() |
![]() |
Home -> Community -> Usenet -> c.d.o.server -> Re: Index key compression
On 25 May 2001 08:52:14 -0700, onlyforposting_at_yahoo.com (Vikas Agnihotri) wrote:
>
>Sounds nice in theory, but any hidden gotchas, pitfalls? Performance
>issues? Bugs?
>
>Getting into the internals of it, is this still a b*tree index? How
>does Oracle do the compression? Store pointers to other rows with
>these keys in the leaf blocks?
>
Vikas, you need to get Jonathan's book. It has an excellent section daling precisely with this.
Cheers
Nuno Souto
nsouto_at_bigpond.net.au.nospam
http://www.users.bigpond.net.au/the_Den/index.html
Received on Fri May 25 2001 - 11:01:54 CDT
![]() |
![]() |