this post was submitted on 11 Feb 2025
361 points (95.2% liked)

Technology

71989 readers
3292 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 news or articles.
  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, this includes using AI responses and summaries. To ask if your bot can be added please contact a mod.
  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
L3s@lemmy.world
enu@lemmy.world
technopagan@lemmy.world
L4s@lemmy.world
L3s@hackingne.ws
L4s@hackingne.ws
361
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 4 months ago by Cat@ponder.cat to c/technology@lemmy.world
50 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] tyler@programming.dev 66 points 4 months ago (30 children)

This is incredible, but why does the article end by stating that this might not have any immediate applications? Shouldn’t this immediately result in more efficient hash tables in everyday programming languages?

[–] rockSlayer@lemmy.world 2 points 4 months ago

Infrastructural APIs are much slower to change, and in a lot of cases the use of those APIs are dependent on a specific version. The change will definitely occur over time as the practical limitations are discovered

load more comments (29 replies)