> Essentially you pick what fields in complex (maybe even nested) data structure... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Veedrac on Aug 25, 2017 \| parent \| context \| favorite \| on: Ask HN: What is your favorite CS paper? > Essentially you pick what fields in complex (maybe even nested) data structures to sort by, in what order, and the system makes a sort. Wait, is that it? What makes this novel?

KirinDave on Aug 25, 2017 [–]

What's novel is projecting that operation efficiently into a field where radix sort can operate on all the discrimination at once.

Veedrac on Aug 25, 2017 | [–]

Can you give an example where the obvious method is inefficient, and what this would do?

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact