Why databases use ordered indexes but programming uses hash tables

#346 – December 15, 2019

sponsor

Build your programming skills with Manning

Looking to upgrade your programming skills? Here’s something that will really help—Manning Publications are offering an exclusive 40% off your entire order at manning.com! Just use the code progdig40 when you checkout.

this week's favorite

Why databases use ordered indexes but programming uses hash tables

The traditional answer is that hash tables are designed to be efficient when storing data in memory, while B-Trees are designed for slower storage that is accessed in blocks. However, this is not a fundamental property of these data structures.

Building a search engine from scratch

The expectation for a modern web search engine is to be able to answer any user question with the most relevant documents that exist for the topic on the internet. The search engine is also expected to be blazingly fast, but we can ignore that for the time being.

Privacy Analysis of Tiktok’s App and Website

I did a detailed privacy check of the app TikTok and its corresponding website. Multiple law infringements, trust, transparency and data protection breaches were found.

AUTHentication VS AUTHorization

I decided to write this small post up because I get AUTHentication and AUTHorization confused a lot and want to help make it more clear for anyone else struggling.

Things end users care about but programmers don't

And we agree with them, but our tools make it really hard to provide.

newsletters