3 ms·
for equality predicate you can just use hash based index, for range search the situation is of course worse, yet you can have a somewhat like a partially/probab
by trhway 6y ago
for equality predicate you can just use hash based index, for range search the situation is of course worse, yet you can have a somewhat like a partially/probabilistically preserving order hash so that you can produce a number of candidates orders of magnitude less than the whole table scan.