I am wondering how the oncoming SSD technology affects (mosty system) programming. Tons of questions arise, but here are some most obvious ones: Can the speed of disk access be considered anywhere near to the memory speed? If not, is it either just a temporary state, or there are some fundamental reasons why SSD won't ever be as fast as RAM? Are B-Trees (and its cousins) still relevant? If so, are there any adjustments or modifications of B-Trees (B+-Trees, R-Trees, etc.) made for SSD? If not, are there any other data structures crafted for SSD?

Programming in the era of SSD

I am wondering how the oncoming SSD technology affects (mosty system) programming. Tons of questions arise, but here are some most obvious ones:

Can the speed of disk access be considered anywhere near to the memory speed?
If not, is it either just a temporary state, or there are some fundamental reasons why SSD won't ever be as fast as RAM?
Are B-Trees (and its cousins) still relevant?
If so, are there any adjustments or modifications of B-Trees (B+-Trees, R-Trees, etc.) made for SSD? If not, are there any other data structures crafted for SSD?