Hash Clusters

From: Loren Goodman <loren_at_calsys.com>
Date: 1997/08/12
Message-ID: <5sq5go$saj@eve.enteract.com>#1/1

I am making a reporting database with about 1,000,000 rows which are about 800 bytes wide in Oracle 8 on NT
I found substancial performance improvement with bitmap indexes over b-Tree.

Will setting a hash cluster on Row_ID provide any performace increase?

My retrieval time is about 10 seconds to bring back an aggreagate function on 20-30 thousand rows on an SMP intel 200 with several parameters in the where clause.

Does anyone know what else I can do on the index side to imporve performace, we are looking for under 5 seconds?

Please response vie eMail to loren_at_calsys.com

Thanks Received on Tue Aug 12 1997 - 00:00:00 CDT