4 ms·
D. Richard Hipp used TACOP to implement a B-tree for SQLite: > "Nobody ever taught me about a B-tree. I had heard of it. When I went to write my own B-tree, on
by scrlk 3y ago
D. Richard Hipp used TACOP to implement a B-tree for SQLite:
> "Nobody ever taught me about a B-tree. I had heard of it. When I went to write my own B-tree, on the bookshelf behind me, I’ve got Don Knuth’s The Art of Computer Programming, so I just pulled that down, I flipped to the chapter on searching and looked up B-trees and he described the algorithm. That’s what I did. Funny thing, Don gives us details on the algorithm for searching a B-tree and for inserting into a B-tree. He does not provide an algorithm for deleting from the B-tree. That’s an exercise at the end of the chapter, so before I wrote my own B-tree I had to solve the exercise at the end. Thanks, Don. I really appreciate it."
https://corecursive.com/066-sqlite-with-richard-hipp/#b-trees-and-the-art-of-computer-programming https://corecursive.com/066-sqlite-with-richard-hipp/#b-tree...
- hiAndrewQuinn 3y agoTwo of my favorite names in computer programming, working across time. Love to see it.
- zlg_codes 3y agoThis is the first article or interview I've enjoyed reading in months. Thanks for sharing!
- iso8859-1 3y agoThe interviewer is on HN: https://news.ycombinator.com/user?id=adamgordonbell https://news.ycombinator.com/user?id=adamgordonbell My favorite episode is https://corecursive.com/remote-developer/ https://corecursive.com/remote-developer/
- tenahu 3y agoTop notch podcast, one of my favorites.