- 0 Posts
- 3 Comments
Joined 2 years ago
Cake day: November 17th, 2023
You are not logged in. If you use a Fediverse account that is able to follow users, you can follow this user.
blx@lemmy.zipto
Technology@lemmy.world•A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.English
162·1 year ago“Constant average query time” is not that hard to understand. It means that sometimes access time is e.g. linear, and sometimes you get your content before executing the code. With a hash table large enough and full enough, this can be used to fetch content seconds, minutes, days, potentially years before the program even exists. That’s one hell of a breakthrough.
[edit] /s, oops

That’s a pretty dumb reason, but that’s what’s been putting me off for so long. Oh well, I’m a konvert now…