Timeline for Will B-Trees and Other Data Structures Become Obsolete With The Advent of Solid State Drives?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2014 at 7:52 | comment | added | user8709 | @user955091 - I meant because of cache-oblivious data structures (pedantically meaning structures that are optimal in the cache-oblivious model), but I was a bit overexcited about them back then. Other data structures aren't going to disappear any time soon. For one thing, cache isn't the only performance issue - parallelism makes different demands. Besides, needing key-based ordering is often a special case - normally, hash tables are king. It can be hard to see a "randomized" layout as cache-friendly, but one access to directly fetch the item is hard to beat - you don't need locality. | |
| Apr 4, 2014 at 3:56 | comment | added | Yang Bo | Hi, did you mean that B-tree will obsolete, because of cache-oblivious data structures, not because of SSDs? But how about other data structures, like block management in a DBMS? | |
| Jun 15, 2013 at 16:47 | comment | added | dan_waterworth | This MIT course also has information on cache oblivious data structures. | |
| Oct 18, 2011 at 15:57 | vote | accept | Daniel Scocco | ||
| Oct 18, 2011 at 15:34 | comment | added | Daniel Scocco | Interesting. You gave some good pointers (no pun intended!) to explore this topic further. Thanks. | |
| Oct 18, 2011 at 15:29 | history | answered | user8709 | CC BY-SA 3.0 |