Reiser4, Part II: Designing Trees that Cache Well
In upcoming articles we will discuss why, even when nothing is cached in memory, Reiser4's performance is much higher than that of ReiserFS v3, why dancing trees are better than space-usage balanced trees and how we added support for transactions while at the same time greatly reducing the amount of data that is written twice.
Hans Reiser (firstname.lastname@example.org) entered UC Berkeley in 1979 after completing the eighth grade and majored in “Systematizing”, an individual major based on the study of how theoretical models are developed. His senior thesis discussed how the philosophy of the hard sciences differs from that of computer science, with the development of a naming system as a case study. He is still implementing that naming system, of which Reiser4 is the storage layer.
- Readers' Choice Awards 2013
- Mars Needs Women
- IBM Will Minimize Impact of Future Disasters
- Sublime Text: One Editor to Rule Them All?
- December 2013 Issue of Linux Journal: Readers' Choice
- Raspberry Pi: the Perfect Home Server
- RSS Feeds
- Tech Tip: Really Simple HTTP Server with Python
- Linux Systems Administrator
- Web Administration Scripts
9 min 44 sec ago
- Rapid[Disk,Cache] better than native ram caching?
34 min 40 sec ago
- Nothing is perfect
47 min 59 sec ago
- Mixtapes Community
6 hours 26 min ago
- KDE is one true DE
7 hours 1 min ago
- Command Line Shells (Bash, Zsh, etc.) are 2nd place
7 hours 29 min ago
9 hours 24 min ago
- yes it's Jupiter Broadcasting
10 hours 44 min ago
- nice to see PClinuxOS finally
13 hours 17 min ago
- Personally, I am no longer a
14 hours 14 min ago