Hierarchical file system to provide cataloging and retrieval of data

In a computer system where data is to be catalogued when stored into a memory device, a method performed by the computer system for providing a hierarchial filing system to catalogue said data into a volume of said memory device for subsequent retrieval, comprising the steps of:

• creating a root directory, a plurality of subdirectories and a plurality of files;
• organizing said root directory, subdirectories and files into a hypothetical catalog wherein said root directory is at a topmost level and said subdirectories are arranged at various subsequent levels from said root directory, some of said subdirectories branch from other of said subdirectories, but said subdirectories being interconnected such that for each of said subdirectories there is only a singular path from itself to said root directory, and wherein each of said files being interconnected to branch from a certain one of said subdirectories only, such that for each file there is only a singular path from itself to said root directory;
• assigning a unique numerical directory identification value to said root directory and to each of said subdirectories in said volume;
• assigning an identification name to said root directory and to each of said subdirectories and files, such that no two subdirectories branching from a root directory has a same name, no two subdirectories branching from another subdirectory has a same name, and no two files branching from one of said directories has a same name;
• wherein each of said subdirectories and files are each provided with a key comprised of its identification name and its next higher level directory identification value;
• forming a linear list of files and subdirectory entries such that said file and subdirectory entries are ordered by said keys, such that said root directory being the highest level and files being the lowest level;
• and said interconnection of each of said singular path is provided by each file and subdirectory identification name being associated with directory identification value of its next higher level;
• forming a B-Tree indexing structure having a beginning node, a plurality of indexing nodes, and a plurality of terminal nodes;
• storing said linear list in said terminal nodes of said B-Tree structure in alphanumerical order according to said numerical directory value;
• assigning said identification name of a given file to a respective portion of said data;
• storing said data;
• placing memory location information in said files, wherein for each given file its memory location information locates its respective portion of said data stored in said memory device.