Re: searching for records with skewed data values (skewed data changes rapidly)

Daniel Morgan wrote :
> If updates are taking place this might not be a good place for a bitmap
> index. And if the values are there only for short periods of time I'd
> argue that partitioning would be very expensive both in dollars and in
> the time required for records to move from partition to partition.

I suggested partitioning assuming that updates are done to a row only 5 times (max). But the table is being queried (probably repeatedly) on that column. Finally it is for the user to look into all possible options and decide which are appropriate for the application.

Pratap Deshmukh
Cognizant Technology Solutions, India Received on Wed Aug 18 2004 - 08:11:23 CDT