Technology

63614 readers

4247 users here now

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

Our Rules

Follow the lemmy.world rules.
Only tech related content.
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, to ask if your bot can be added please contact us.
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]

362

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

51 comments fedilink hide all child comments

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

[–] BeigeAgenda 1 points 2 weeks ago* (last edited 2 weeks ago)

I have skimmed the paper "Tiny Pointers", it seems they use several levels of tables "Load balancing" and "overflow" to store the hashes, and they claim that they can save space/time by splitting up the hash in a part that can be computed and a unique part.

It doesn't look real groundbreaking, more like a tool that has it's applications in some places.