Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
hobs
on Dec 24, 2023
|
parent
|
context
|
favorite
| on:
How does a B-tree make queries fast?
For this use case people generally choose sequential UUIDs or they want random ones to prevent hot pages for their inserts.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
