Partial values and ranges of values are very easily dealt with, all with approximately the same speed inside a non-be part of search. In scenarios where by possibly sort of index will suite your purposes, there isn't a regularly “ideal” preference, due to the fact you can find eventualities where hash indices outperform B-trees, and vice versa.