"The kaki of a file system that makes use of the concept of inodes surprises many users who are not used to it at first:" What does "kaki" mean? 22.214.171.124 19:50, 27 November 2005 (UTC)
- Hehe, obviously vandalism... Reverted. 126.96.36.199 01:08, 4 December 2005 (UTC).....
- I elaborated on the formal definition, and grounded it with some references. jdmartin86 —Preceding undated comment added 04:50, 25 November 2013 (UTC)
Where is the inode information stored? With the file? Or in a special directory?
- Check this out -> Unix_File_System
For anyone who knows enough about it to do so, some discussion here about the balance between having enough inodes available and using up too much space when building a filesystem would be helpful. Examples might include disk space usage and inode count for the same number of files when different -i values are used with mke2fs. --joshua orvis 14:49, 8 January 2007 (UTC)
Variations in inode file systems
The whole section seems to be a bit schizophrenic. For example:
- inode file systems can fragment as severly[sic] as FAT based file systems, yet universally inode file systems lack deframenation tools.
- An inode file system would have to be offline to be fully defragmented on most systems -- but some online defragmenation tools exist.
The subsection about i_generation seem to really be either NFS only topics or NFS and Linux only topics.
There's also some odd comparison to FAT32 and NTFS.
The first paragraph here appears to contradict itself: first saying that the number of inodes (and therefore max files) is fixed, but then saying that most file systems can handle unlimited files —Preceding unsigned comment added by 188.8.131.52 (talk) 00:08, 12 March 2008 (UTC)
- I agree. I am removing the later phrase, as it is probably the incorrect one. SSPecter Talk|E-Mail ◆ 12:08, 19 March 2008 (UTC).
In the following sentence, it is unclear which graph has N-1 edges: "This made the directory structure into an arbitrary directed graph as opposed to a directed acyclic graph (DAG), a connected graph with N-1 edges for N nodes." --Bobbozzo (talk) 21:09, 15 December 2009 (UTC)
"This made the directory structure into an arbitrary directed graph as opposed to a directed acyclic graph (DAG), a connected graph with N-1 edges for N nodes."
Neither of these classes of graphs (arbit. directed or DAG) necessarily have N-1 edges for N nodes. In fact the first diagrams of the respective links in the text show counterexamples. |E| = |V-1| is the characterisation of a tree, if I remember correctly. Also this part of the text seems only marginally to do with inodes. Chaos.squirrel (talk) 13:45, 14 June 2010 (UTC)
- I agree with Chaos.squirrel. A connected undirected graph without cycles does have N-1 edges for N nodes and is thus a tree. However, with DIRECTED graphs, two ways of getting from one node to another don't necessarily imply existence of a cycle. As it seems that a long time has passed since Chaos.squirrel's comment and noone answered to it, I will take the liberty and remove the invalid statement about DAGs myself. Czestmyr (talk) 11:15, 5 September 2010 (UTC)
The UNIX Programming Environment
Page 57 of the The UNIX Programming Environment states "The administrative information is stored in the inode (over the years, the hyphen fell out of "i-node"), [...]" implying that the i stands for information. Should this be added? --BiT (talk) 07:18, 22 November 2010 (UTC)
- On page 95 of Jerome H. Saltzer's book Principles of Computer System Design, he writes:
To support this requirement, the UNIX file system creates an index node, or inode for short, as a container for meta-data about the file.
Number of inodes on disk
How to retrieve it ? ( df -i <device> ) How to change it ? ( tune2fs -I <device> ) where to look the description of this procedures? — Preceding unsigned comment added by Arsen.Shnurkov (talk • contribs) 08:53, 13 May 2012 (UTC)
max. Byte for a file - pic in german wiki
inode vs. i-node
Someone boldly revised all the occurrences in this article of 'inode' to 'i-node'. While this might be appropriate, it probably should have had some discussion or evidence that is the majority usage (per WP:COMMONNAME). As the editor was not registered, s/he can be excused from not also renaming the article.
As a starting point, a Google search of Unix inode indicates 696,000 occurrences while Unix i-node has 19,200,000. Linux inode has 1,860,000 and Linux i-node has 9,300,000. At first blush, this seems to weigh heavily in favor of i-node.
However, inspecting the results shows that Google appears to have ignored the hyphen as the first hyphen results do not show any context with a hyphenated word. Therefore I repeated the searches with quotes around i-node. For this Linux "i-node" returns 89,700 results and Unix "i-node" returns 81,600 results. This strongly indicates that inode is the most common. —EncMstr (talk) 21:47, 24 November 2013 (UTC)