4 ms·
It's pretty much true for any B-tree based index. You could get around it by using a combined index on another timestamp value, but that's going to be a very la
by zerd 6y ago
It's pretty much true for any B-tree based index. You could get around it by using a combined index on another timestamp value, but that's going to be a very large index. Or reduce it by partitioning by e.g. year-month. Even hash-based indices would be slightly impacted due to less locality.