this post was submitted on 11 Feb 2025
293 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]
293
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] 0 points 1 day ago (1 children)

I haven't read the Tiny Pointers article yet, but the OP article implies that the new hash tables may rely on them. If so, then the blocker could be the introduction (or lack thereof) of tiny pointers in programming languages.

[โ€“] [email protected] 1 points 13 hours ago

Tiny Pointers was the paper that the student read to get the idea. The paper he co-authored was "Optimal Bounds for Open Addressing Without Reordering"