2 ms·
Let's add one more class of algorithm without which the world as we know it wouldn't function: indexing algorithms for databases, such as B-tree indexes: https
by greenyoda 12y ago
Let's add one more class of algorithm without which the world as we know it wouldn't function: indexing algorithms for databases, such as B-tree indexes:
https://en.wikipedia.org/wiki/B-tree https://en.wikipedia.org/wiki/B-tree
Imagine how long a keyword search of the web would take if there was no indexing! Or even finding the bank account associated with your ATM card among your bank's tens of millions of accounts.
I'm sure the HN community can think of other crucially important algorithms that should be added to this list...
- dalke 12y agoSure. Based on the broad definitions of that posting, the Kalman filter (radar systems), Marzullo's algorithm (internet time keeping), and CRC-32 (every ethernet packet) are also crucially important to the modern world. There are so many crucially important algorithms that any listing of the top 10 will leave out hundreds if not thousands of equally crucial algorithms.
- sytelus 12y agoYou are mixing up B-tree and reverse index. B-tree is significant when you have slow media like disk. Most index serving currently happens from memory and B-tree is not used there.
- greenyoda 12y agoI'm pretty sure that any traditional database (Oracle, MySQL, etc.) needs a way to store indexes on disk.