File Hierarchy

A file is formed by using a combination of elements and files like file id, file size, file name etc. Each elements of a file is stored in the form of files itself but in different manner. On seeing this from the top it will be like a single file with others as its properties. To use a file properly certain things and events has to be ordered properly. The process of ordering these files is called “File Hierarchy”.

Eventually another theory also revolves that, a file hierarchy is how folders, drives and files displayed in an operating system. Different operating system uses different file hierarchical structure. For example the Windows operating system uses GUI based file hierarchy structure. To be more specific in Windows operating system the root of the file will be indicated by + symbol. When clicked the sub files are displayed down in a tree like structure. However, in Ms Dos operating system, the hierarchy will be linear, the symbol used to differentiate between one file, and another is using backward slash.
For e.g. D:\Allison \Wilson \Morison...

And regarding events and process, they are to be stored properly and to initialize them, use them efficiently is essential. This is where the need for hierarchy arises. These clicks, events and process initialization are grouped and kept in a file. When a file is needed by the operating system a sub file will be called using a process handle and that will simultaneously call the other sub file groups and actions. Finally ends in a file display or a file being processed.

Rise of File Hierarchy Needs:

Before data bases and data mining were introduced, the data were processed to information using file processing programs. In those days it took several programs and time to process a single file. Also the file processing is not a branched process instead a linear process. To increase throughput the file programs are grouped and all the files are accessed by a single bulky program. And the evolution started from there which later became a multi branched, compressed hierarchical structure with increased throughput and most negligible retrieval time.
However the file processing systems were replaced data bases and data warehouses, this is the place where a data can be viewed in 2d or multidimensional form.


  • Since the information of the next file that is to be tracked is available, the operating system will easily find the requested file.
  • The hard drive header doesn’t want to traverse any unwanted information or data
  • In case of failure, the errors can be traced and rectified more easily because when on seeing the last control passes that halts the file processing.
  • The sub grouping techniques will be more useful when file volume explodes


  • If the root file is deleted or lost then the whole hierarchy system fails all of a sudden.
  • File hierarchy that is in loop use unwanted file retrieval time and ends up in a mess.
  • Additionally if the information about the next subsequent file has to be stored in the same file which owes lot of space, but the current technology is vast superior.
  • Security mechanism is difficult to implement in file hierarchy.
Safe and Secure
Safe and Secure