# US 2009/0271418 A1 · Computer file system with path lookup tables

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2009/0271418 A1
- Document ID: US20090271418A1
- Status: Published application
- Kind: A1
- Application number: 12/110,660
- Filed: 2008-04-28
- Published: 2009-10-29
- Earliest claimed: 2008-04-28
- Assignees: VMware, Inc.
- Inventors: Satyam B. VAGHANI; Yuen-Lin TAN
- Web page: https://patentgrep.com/patent/US20090271418A1

## CPC

- G06F 16/185: Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof (details of archiving G06F16/11)
- G06F 11/1435: {using file system or storage system metadata}
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F 16/162: {Delete operations (erasing in storage systems G06F3/0652)}
- G06F 16/9017: {using directory or table look-up (use of a directory or look-up table in file systems G06F16/13)}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A namespace is provided in a file system that employs logical volumes. With the namespace, the file system can withstand data storage units going offline without compromising accessibility of the files in the data storage units that remain online. The files in the online data storage units remain accessible through the use of path lookup tables that are stored in the online data storage units.

## Claims

### Claim 1

A computer file system having file objects arranged in a hierarchy of directories, comprising:
a first data storage unit having a first set of file objects and a first table of path entries that specify paths for the first set of file objects; and
a second data storage unit having a second set of file objects and a second table of path entries that specify paths for the second set of file objects.

### Claim 2 (depends on 1)

The system of claim 1, further comprising a logical volume manager configured to organize the first data storage unit and the second data storage unit into a number of logical volumes.

### Claim 3 (depends on 1)

The system of claim 1, wherein each path entry of the first table includes an index number that is a unique integer when compared with all the entries stored in the first table, and each path entry of the second table includes an index number that is a unique integer when compared with all the entries stored in the second table.

### Claim 4 (depends on 3)

The system of claim 3, wherein each path entry of the first and second tables further includes an object identifier that includes a unique file system identifier, an inode number for a file object, and a generation number for the file object.

### Claim 5 (depends on 1)

The system of claim 1, wherein each of the first and second tables is constructed as a B+ tree with inodes corresponding to the first data storage unit and the second data storage unit as tree nodes and path entries as leaves, the entries including an index number that is a unique integer when compared with all of the path entries stored in the B+ tree.

### Claim 6 (depends on 1)

The system of claim 1, further comprising a computing system configured to store path entries of the first and second tables in a main table, and restore the first table in the first data storage unit and restore the second table in the second data storage unit.

### Claim 7

A computer system having file objects arranged in a hierarchy of directories, comprising:
a first data storage unit configured to store a first set of file objects;
a second data storage unit configured to store a second set of file objects; and
a path lookup table that contains a first set of path entries that specify paths for the first set of file objects and a second set of path entries that specify paths for the second set of file objects.

### Claim 8 (depends on 7)

The system of claim 7, wherein each path entry of the path lookup table includes an index number that is a unique integer when compared with all the entries stored in the path lookup table, a path name, and an object identifier that includes a unique identifier, an inode number for a file object and a generation number for the file object.

### Claim 9 (depends on 7)

The system of claim 7, wherein each path entry is a fixed size.

### Claim 10 (depends on 7)

The system of claim 7, wherein each path entry is a variable size that is specified by a field in the entry.

### Claim 11 (depends on 7)

The system of claim 7, further comprising a hardware platform for virtual machines and a virtual machine file system and logical volume manager for the virtual machines, the hardware platform including a processing unit and a memory device, wherein said path lookup table is stored in the memory device.

### Claim 12 (depends on 7)

The system of claim 7, wherein a portion of the path lookup table that includes the first set of path entries is stored on the first data storage unit and another portion of the path lookup table that includes the second set of path entries is stored on the second data storage unit.

### Claim 13

A method of generating a hierarchical file system having a first set of file objects stored in a first data storage unit and a second set of file objects stored in a second data storage unit, said method comprising:
creating a first table of path entries, each specifying paths for at least one file object in the first set of file objects;
storing the first table in the first data storage unit;
creating a second table of path entries, each specifying paths for at least one file object in the second set of file objects; and
storing the second table in the second data storage unit.

### Claim 14 (depends on 13)

The method of claim 13, wherein one of the path entries of the first and second tables for a file object specifies a partial path for said file object.

### Claim 15 (depends on 13)

The method of claim 13, wherein one of the path entries of the first and second tables for a file object specifies a complete path for said file object.

### Claim 16 (depends on 13)

The method of claim 13, wherein each path entry of the first table includes an index number that is a unique integer when compared with all the entries stored in the first table, and each path entry of the second table includes an index number that is a unique integer when compared with all the entries stored in the second table.

### Claim 17 (depends on 16)

The method of claim 16, wherein each path entry of the first and second tables further includes an object identifier that includes a unique identifier, an inode number for a file object, and a generation number for the file object.

### Claim 18 (depends on 13)

The method of claim 13, wherein a path entry is inserted in the first table or the second table when a file object corresponding said path entry is created.

### Claim 19 (depends on 13)

The method of claim 13, wherein a path entry is modified when a file object corresponding said path entry is renamed.

### Claim 20 (depends on 13)

The method of claim 13, wherein a path entry is inserted in the first table or the second table by a background process some time after a file object corresponding said path entry is created.

### Claim 21 (depends on 13)

The method of claim 13, wherein a path entry is modified by a background process some time after a file object corresponding said path entry is renamed.

### Claim 22 (depends on 13)

The method of claim 13, wherein a path entry is removed from the first table or the second table by a background process some time after a file object corresponding said path entry is deleted.

### Claim 23 (depends on 13)

The method of claim 13, further comprising: determining that a file object needs to have a path entry in the first or second table prior to creating the path entry corresponding to said file object.

### Claim 24 (depends on 13)

The method of claim 13, further comprising:
removing a path entry for a file object from the first table when said file object is deleted from the first data storage unit; and
removing a path entry for a file object from the second table when said file object is deleted from the second data storage unit.

### Claim 25 (depends on 13)

The method of claim 13, further comprising:
removing a path entry for a file object from the first table when said file object is renamed; and
removing a path entry for a file object from the second table when said file object is renamed.

### Claim 26

A method of determining an object identifier of a file object stored in a hierarchical file system having a first set of file objects stored in a first data storage unit and a second set of file objects stored in a second data storage unit, said method comprising:
storing a first table of path entries, each specifying paths for at least one file object in the first set of file objects, in the first data storage unit;
storing a second table of path entries, each specifying paths for at least one file object in the second set of file objects, in the second data storage unit; and
determining a path entry corresponding to a file object from one of the first and second tables; and
reading an object identifier from the path entry corresponding to said file object.

### Claim 27 (depends on 26)

The method of claim 26, wherein the object identifier includes a unique file system identifier, an inode number for said file object, and a generation number for said file object.

### Claim 28 (depends on 26)

The method of claim 26, wherein the path entry corresponding to said file object is determined by comparing a path of said file object with paths stored in the first and second tables.

### Claim 29 (depends on 26)

The method of claim 26, further comprising traversing a path of the file object, wherein the steps of determining and reading are carried out when an inode corresponding to a portion of the path is determined to be invalid.

### Claim 30 (depends on 26)

The method of claim 26, further comprising determining that table entry insertion is enabled for each file object in the first set of file objects.

### Claim 31 (depends on 26)

The method of claim 26, wherein each of the first and second tables is constructed as a B+ tree with inodes corresponding to the first data storage unit and the second data storage unit as tree nodes and path entries as leaves, the entries including an index number that is a unique integer when compared with all of the path entries stored in the B+ tree
