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

It should be duly noted that hashing used for table lookup is a workaround technique, a hack to overcome the inherent inefficiency of the Von Neumann design.


Interesting. Would you elaborate, and/or give an example of some non-Von Neumann designs and how they accomplish table lookups more efficiently?




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

Search: