SpadFS
Encyclopedia
SpadFS is an experimental file system
for Linux
developed by Mikuláš Patočka. SpadFS was first presented at the end of 2006. "Spad" is an abbreviation for Czech
Systém pro Psychopaty A Debily (System for psychopaths and idiots).http://www.root.cz/diskuse/1391/vse/
SpadFS uses crash counting
to handle consistency problems. The filesystem also uses extendible hashing
instead of B-tree
based structures for storage. SpadFS also differs from other traditional filesystems by storing the inode
information together with the directory entry itself.
According to the doctoral thesis, the filesystem has been tested on a search engine with a 1TB RAID array.
File system
A file system is a means to organize data expected to be retained after a program terminates by providing procedures to store, retrieve and update data, as well as manage the available space on the device which contain it. A file system organizes data in an efficient manner and is tuned to the...
for Linux
Linux
Linux is a Unix-like computer operating system assembled under the model of free and open source software development and distribution. The defining component of any Linux system is the Linux kernel, an operating system kernel first released October 5, 1991 by Linus Torvalds...
developed by Mikuláš Patočka. SpadFS was first presented at the end of 2006. "Spad" is an abbreviation for Czech
Czech language
Czech is a West Slavic language with about 12 million native speakers; it is the majority language in the Czech Republic and spoken by Czechs worldwide. The language was known as Bohemian in English until the late 19th century...
Systém pro Psychopaty A Debily (System for psychopaths and idiots).http://www.root.cz/diskuse/1391/vse/
SpadFS uses crash counting
Crash counting
Crash counting is a feature of a file system designed as an alternative to journaling. It is claimed that it maintains consistency across crashes without the code complexity of implementing journaling.- External links :*...
to handle consistency problems. The filesystem also uses extendible hashing
Extendible hashing
Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing is an incremental operation...
instead of B-tree
B-tree
In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children...
based structures for storage. SpadFS also differs from other traditional filesystems by storing the inode
Inode
In computing, an inode is a data structure on a traditional Unix-style file system such as UFS. An inode stores all the information about a regular file, directory, or other file system object, except its data and name....
information together with the directory entry itself.
According to the doctoral thesis, the filesystem has been tested on a search engine with a 1TB RAID array.