lechiffre on Nostr: Yes, 100% random hex keys index inefficiently, at least compared to a monotonicaly ...
Yes, 100% random hex keys index inefficiently, at least compared to a monotonicaly increasing sequence. This is because the index is almost surely a B tree and random inserts are super cache unfriendly
Published at
2023-03-24 23:08:06Event JSON
{
"id": "907d14bad9c801b61ba086100211c7b31fdef1e66cda2a64909a08937333639d",
"pubkey": "d7b76d02c758a62a505e03bd5f5049aaee4e7e36283d273c7f6798912692df2b",
"created_at": 1679699286,
"kind": 1,
"tags": [
[
"e",
"c1f3b19b33f7bc4ebff97720a9f70664cf011952211686c5c0c45ef92938941a"
],
[
"p",
"460c25e682fda7832b52d1f22d3d22b3176d972f60dcdc3212ed8c92ef85065c"
]
],
"content": "Yes, 100% random hex keys index inefficiently, at least compared to a monotonicaly increasing sequence. This is because the index is almost surely a B tree and random inserts are super cache unfriendly",
"sig": "c068966a840980f3e7430f37718ee01521e17152c56df946dbaeb08ef160cd1401b04b6ea9758b4ff909c1e3688539db941cd5805d1e8b2e2552828bc5122695"
}
