Hello.
My question is a little broad but maybe you already saw something like
this ;-)
Here is my scenario:
Let us have a large table which contains over 20 million records and
search for rows that are duplicated under some rule.
The column involved in that comparison rule, named AREA, is declared
VARCHAR2(4000) NOT NULL.
Seeing that an usual index built on column AREA would not be so good,
I tried to add a column, HASHVALUE, which always contains a suitable
hash-value given by the standard "dbms_utility.get_hash_value"
function.
Now that I have a much smaller column to search through for
duplicates, should I put an index on column HASHVALUE, do you think
overall performance would be improved or not?
Thank you in advance.
Matt.
|
