Re: Hash Clusters .vs. Indexed Tables

R.A. van Geleuken wrote:
>
> Robert Walters wrote:
> >
> > Esteemed Wizards,

Sort of true, and sort of false. A hashed cluster can be more efficient than an indexed table because it stores the entries in a the table based on the hash of the key values. This means that there is a direct relationship between the key value and its' physical storage. Hashed clusters work great for tables that are fixed lookup tables. Something like a customer index that is never updated would be appropriate. A small table, like a state lookup table for instance, won't gain much from either approach. You're probably better off pinning a small lookup table in the lru cache. There are a couple of ways to do this. Look it up in the Tuning guide.

Fred Received on Sun Apr 07 1996 - 00:00:00 CEST