srp_hash indexing the result

BarryStevens

I was wondering if there was any hash algorithm that would lend itself to being btree indexed.
I used the ADLER32 and the results were not favorable, I assume there must be certain 'values' that mucks up the indexing.
Not a big issue.
The value being indexed is a path/filename which can be up to 80 chars long. In the end I used the full field value(striping embedded spaces).

KevinFournier

The longer the algorithm, the better. However, why hash the filepath? If you just use that, you have the most unique values already and OI linear hashing takes care of the rest.

BarryStevens

Thanks Kevin.
I just thought if it was shorter would be better, plus I was curious :)
It is a process that is not run very often, and it works, so as they say..'if it ain't broke....'