this post was submitted on 11 Feb 2025
292 points (95.6% liked)

Technology

62073 readers
4952 users here now

This is a most excellent place for technology news and articles.

Our Rules

  1. Follow the lemmy.world rules.
  2. Only tech related content.
  3. Be excellent to each other!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, to ask if your bot can be added please contact us.
  9. Check for duplicates before posting, duplicates may be removed
  10. Accounts 7 days and younger will have their posts automatically removed.

Approved Bots

founded 2 years ago
MODERATORS
[email protected]
[email protected]
[email protected]
[email protected]
292
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible. (www.quantamagazine.org)
submitted 1 day ago by [email protected] to c/[email protected]
39 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 6 points 1 day ago (2 children)

Hash trees are super efficient when they're not nearly full. So the standard trick is just to resize them when they're too close to capacity.

The new approach is probably only going to be useful in highly memory constrained applications, where resizing isn't an option.

[–] [email protected] 6 points 18 hours ago

Hash tables are used in literally everything and they always need to minimize resizing because it’s a very expensive operation.

I suspect this will silently trickle into lots of things once it gets picked up by standard Python and JavaScript platforms, but that will take years.

[–] [email protected] 3 points 22 hours ago

So... databases? Especially in data centers? Still a nice boost in that case