can't you better hash the keys and match hashes? They arent variable length, and... | Hacker News

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

		vectorEQ on Oct 12, 2018 \| parent \| context \| favorite \| on: Masstree: A cache-friendly mashup of tries and B-t... can't you better hash the keys and match hashes? They arent variable length, and will be unique per unique string regardless of the length.

jsnell on Oct 12, 2018 | [–]

That won't give you range queries / ordered iteration, which were the point of using a tree rather than a hash table in the first place.

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