The Reiser4 Filesystem
Google engEDU
1 hr 3 min – Feb 6, 2006

Google TechTalks
February 6, 2006

Han Reiser

Hans Reiser was concerned that hierarchical and relational naming systems add structure not inherent in the information, and that boolean algebra fails to represent structure, and so he develeoped a set of semantics which attempt to match rather than mold structure.

He then founded Namesys in 1993 when he went to Russia and hired a small team of programmers to implement the storage layer for these semantics, known as the Reiserfs filesystem for Linux. He spent 5 years arguing over algorithms on evenings and weekends, and working day jobs in Silicon Valley, and then finally the code started to work well enough that he could quit the day jobs.

Then he took all the code, chucked it, and rewrote it from scratch to reflect what he had learned the first time doing it. The new code is called Reiser4.

ABSTRACT
The ReiserFS project aims to add support for semi-structured data querying to the filesystem namespace. Reiser4 is the storage layer for this. It stores all files in a dancing (not balanced)tree, and is currently the overall fastest filesystem for traditional filesystem usage patterns.
video
http://video.google.com/videoplay?docid=6866770590245111825

• Download: “The Reiser4 Filesystem” (video/mp4)

Related posts

• 15 Views Of A Node Link Graph: An Information Visualization Portfolio (0)
• 235 Infinity (0)
• 7 Habits For Effective Text Editing 20 (0)
• 7 Ways To Ruin A Technological Revolution (0)
• A Googly Mysql Cluster Talk (0)