Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
anonymoushn
on June 24, 2024
|
parent
|
context
|
favorite
| on:
B-Trees Require Fewer Comparisons Than Balanced Bi...
This sounds surprising, unless you mean specifically a workload where a bunch of inserts and deletes are made using a stored cursor, so that they don't need to follow a bunch of pointers from the root.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: