aboutsummaryrefslogtreecommitdiffstats
path: root/prototypes/connections/peer-package-budget.json
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-09-30 13:52:30 +0100
committereunhhu <[email protected]>2026-09-30 13:52:30 +0100
commit68dca986ee7ff7d729a15565e2e07127d5b5d1a4 (patch)
tree89e50c693af9594c26320c56e37ee7f0f9b95d6a /prototypes/connections/peer-package-budget.json
parentdacc3cf3e1e7fe6554575cefdb4ac6d7a19a61c6 (diff)
downloadpure-68dca986ee7ff7d729a15565e2e07127d5b5d1a4.tar.gz
pure-68dca986ee7ff7d729a15565e2e07127d5b5d1a4.zip
Say that prefetching items did not pay, and why (109)
Fetching a found item's cells, a leaf's keys and each level's keys ahead made finding and reading items 20% faster on 100,000 items in a micro benchmark, but TPC-C's clean pairs moved 1% at most and finding alone got 48% slower, so it is not in. The owner's finding samples were the descent, not the fields: a write right after a read copies the leaf whole anyway, and what costs is walking structures larger than the caches at random.
Diffstat (limited to 'prototypes/connections/peer-package-budget.json')
0 files changed, 0 insertions, 0 deletions