Indexes are usually btree, it finds what and where the relevant index is (probably from the schema queries), then goes trawling through the b-tree.
That’s how db engines normally work, they don’t liberally go through the entire db contents.
If there’s no index then it finds the start of the table and scans it sequentially (which is exactly what it sounds like).
Indexes are usually btree, it finds what and where the relevant index is (probably from the schema queries), then goes trawling through the b-tree.
That’s how db engines normally work, they don’t liberally go through the entire db contents.
If there’s no index then it finds the start of the table and scans it sequentially (which is exactly what it sounds like).