Technology

72764 readers

1333 users here now

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

Our Rules

Follow the lemmy.world rules.
Only tech related news or articles.
Be excellent to each other!
Mod approved content bots can post up to 10 articles per day.
Threads asking for personal tech support may be deleted.
Politics threads may be removed.
No memes allowed as posts, OK to post as comments.
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.
Check for duplicates before posting, duplicates may be removed
Accounts 7 days and younger will have their posts automatically removed.

Approved Bots

founded 2 years ago

MODERATORS

[email protected]

381

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 5 months ago by [email protected] to c/[email protected]

50 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 65 points 5 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?

[–] [email protected] 7 points 5 months ago* (last edited 5 months ago) (2 children)

Hash tables 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] 5 points 5 months ago

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

load more comments (1 replies)

load more comments (28 replies)