3 ms·
No index gives you O(n) (technically O(n log n)). I'm talking about doing a table scan instead of a seek. Or did you mean O(1)? Some RDBMs have Hash indexes
by cogman10 3y ago
No index gives you O(n) (technically O(n log n)). I'm talking about doing a table scan instead of a seek.
Or did you mean O(1)? Some RDBMs have Hash indexes which given you (effectively) O(1) searches.
For example: https://www.postgresql.org/docs/current/indexes-types.html#INDEXES-TYPES-HASH https://www.postgresql.org/docs/current/indexes-types.html#I...