←back to thread

113 points pseudolus | 1 comments | | HN request time: 0.204s | source
Show context
jasonthorsness ◴[] No.44459044[source]
"Their new algorithm adapts to an adversary’s strategy, but on time scales that it picks randomly"

"Even though many real-world data settings are not adversarial, situations without an adversary can still sometimes involve sudden floods of data to targeted spots, she noted."

This is pretty neat. I bet this will find practical applications.

replies(2): >>44459183 #>>44459434 #
1. rented_mule ◴[] No.44459183[source]
Yeah, this seems applicable to algorithmic management of fill factor in B+ tree based databases.