|
|
|
|
|
by alecco
4457 days ago
|
|
Funny how everything Google does is dogma. They move from complicated hash DS to B+trees, a decade later, and everyone follows. Better DS are currently Log-merge for heavy writes and data parallel BSTs for read-most. At least they are not stubborn for long, I give them that. |
|
It's pretty hard to beat "expected O(1)".