23 points | by StingyJelly 3 days ago ago
1 comments
Nice I guess. I've sometimes thought of doing something similar with a red-black or AVL tree index. So every update writes O(log n) index nodes to the file, but you can do any lookup in O(log n) operations.
Nice I guess. I've sometimes thought of doing something similar with a red-black or AVL tree index. So every update writes O(log n) index nodes to the file, but you can do any lookup in O(log n) operations.