Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
sgarland
on Dec 24, 2023
|
parent
|
context
|
favorite
| on:
How does a B-tree make queries fast?
MySQL stores the PK with every secondary index, and uses it to retrieve the requested rows (unless the query is covered by the index). I’d think for most queries, this would result in a similar slowdown.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: