Assuming there is an index
idx_int on an
int_col column, what is the algorithmic complexity of a query like this?
SELECT id FROM table WHERE table.int_col > 1;
I'm specifically interested in knowing if the query is significantly more inefficient than if doing an equality clause (which, if I understand correctly is O(log N)). I am pretty sure both of them can use a B-tree, so I would expect them to be about the same in terms of complexity / efficiency.
Thanks very much!