|
|
|
|
|
|
by colanderman
3189 days ago
|
|
|
> I don't think the use case you mentioned (as a competitor to B+ trees for direct lookups) is the target use case for a hash index. Exactly – my comment is directed at those who think they might be, because O(1) sounds way better than O(log(n)). When really, except for data sets in the 10s of billions of rows, there are more subtle reasons to use them (as you point out). |
|
|