US5301286A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Memory archiving indexing arrangement
Assignee: Nokia Bell Labs
•
Filing: 1991-01-02
•
Granted: 1994-04-05
•
Expires: 2011-01-02
Abstract
Abstract A facility is provided for locating a file in a backup memory, in which each of the components forming a hierarchical pathname identifying the file is converted into a unique identity using a minimum of bytes, and in which the location of the file in backup memory is determined as a function of each such identity rather than the component names forming the hierarchical pathname.
Inventors
- 👤 Purshotam Rajani
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 06:26
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/901; G06F16/9014; G06F16/9017; G06F16/902; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952; Y10S707/99953; Y10S707/99955
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
191 words
A method of locating a file in a backup memory, said file being one of a group of related files stored in said backup memory, said files being identified by a name common to said files, said name common to said files being one component in a sequence of N components identifying a path name associated with said file, where N≧=1, said method comprising the steps of converting each of said components into a respective identity value, and determining the location at which said file is stored in said backup memory as a function of each of said identity value beginning with the identity value associated with a first component in said sequence of N components, and wherein said method further comprises the steps of storing each of said components in an available location of a first table of locations such that the address of said available location defines the unique identity value of the component stored thereat, and deriving for each of said components an associated hashing number and storing in a second table of locations at a location identified by said hashing number the address of the available location.
Claim 2
Independent Claim
191 words
A method of locating a file in a backup memory, said file being one of a group of related files stored in said backup memory, said files being identified by a name common to said files, said name common to said files being one component in a sequence of N components identifying a path name associated with said file, where N≧=1, said method comprising the steps of converting each of said components into a respective identity value, and determining the location at which said file is stored in said backup memory as a function of each of said identity value beginning with the identity value associated with a first component in said sequence of N components, and wherein said method further comprises the steps of storing each of said components in an available location of a first table of locations such that the address of said available location defines the unique identity value of the component stored thereat, and deriving for each of said components an associated hashing number and storing in a second table of locations at a location identified by said hashing number the address of the available location.
Claim 3
Dependent Claim
56 words
The method set forth in claim 1 wherein said step of converting includes the step of passing each component of said sequence of components through a hashing algorithm to derive the associated hashing number and then retrieving the respective identity value from said second table using said hashing number as an index into said second table.
Claim 4
Dependent Claim
196 words
The method set forth in claim 1 wherein said method further comprises the step of storing as respective entries in a third table each said identity value and other identity values associated with respective ones of other files and/or directories such that individual ones of said entries are formed into groups of linked entries in said third table based on their order within said sequence of components, and storing in each of said entries first and second indices, in which said first index points indirectly to a next subordinate group of entries and in which said second index points indirectly to a backup memory location at which the file identified by the associated identity value is stored, and wherein said step of determining includes the steps of identifying in the order that said components appear in said sequence a first entry forming the associated one of said groups of entries and then locating within the associated group of entries the entry containing the associated unique identity value, and retrieving said second index from an entry forming a last one of said identified groups of entries and containing the unique identity value associated with said file name.
Claim 5
Independent Claim
290 words
A method of associating a backup memory index with a file identified by a file name, said file name being one component in a sequence of components defining a pathname, in which said file name may be associated with a group of related files stored in said backup memory and in which each of said related files is an individual version of said file, said method comprising the steps of establishing in memory a table of records, a group of said records being associated with respective ones of the files forming said group of related files, each of said records of said group of records being linked to one another and having at least one field containing an index identifying the location in said backup memory at which its associated one of said files is stored, converting said components forming said sequence into respective identity values, determining, as a function of each of said values, the location in said memory at which a first one of said group of related records is stored, traversing said linked group of related records to locate that one of said group of records associated with said file, retrieving from said one of said group of records the associated backup memory index identifying the backup memory location at which said file is stored, and wherein said method further comprises the steps of storing each of said components in an available location of a first table of locations such that the address of said available location defines the unique identity value stored thereat, and deriving for each of said components an associated hashing number and storing in a second table of locations at a location identified by said hashing number said address of said available location.
Claim 6
Independent Claim
290 words
A method of associating a backup memory index with a file identified by a file name, said file name being one component in a sequence of components defining a pathname, in which said file name may be associated with a group of related files stored in said backup memory and in which each of said related files is an individual version of said file, said method comprising the steps of establishing in memory a table of records, a group of said records being associated with respective ones of the files forming said group of related files, each of said records of said group of records being linked to one another and having at least one field containing an index identifying the location in said backup memory at which its associated one of said files is stored, converting said components forming said sequence into respective identity values, determining, as a function of each of said values, the location in said memory at which a first one of said group of related records is stored, traversing said linked group of related records to locate that one of said group of records associated with said file, retrieving from said one of said group of records the associated backup memory index identifying the backup memory location at which said file is stored, and wherein said method further comprises the steps of storing each of said components in an available location of a first table of locations such that the address of said available location defines the unique identity value stored thereat, and deriving for each of said components an associated hashing number and storing in a second table of locations at a location identified by said hashing number said address of said available location.
Claim 7
Dependent Claim
55 words
The method set forth in claim 4 wherein said step of converting includes the step of passing each component of said sequence of components through a hashing algorithm to derive the associated hashing number and then retrieving the associated identity from said second table using said hashing number as an index into said second table.
Claim 8
Dependent Claim
196 words
The method set forth in claim 4 wherein said method further comprises the step of storing as entries in a third table each said identity value and other identity values associated with respective ones of other files and/or directories such that individual ones of said entries are formed into groups of linked entries in said third table based on their level within said sequence of components, and storing in each of said entries first and second indices, in which said first index points indirectly to a next subordinate group of entries and in which said second index points indirectly to a backup memory location at which the file identified by the associated unique identity value is stored, and wherein said step of determining includes the steps of identifying in the order that said components appear in said sequence a first entry forming the associated one of said groups of entries and then locating within the associated group of entries the entry containing the associated unique identity value, and retrieving said second index from an entry forming a last one of said identified groups of entries and containing the unique identity value associated with said file name.
References Cited (Backward Citations)
US4558413A
Cited
US5012405A
Cited
US4887204A
Cited
US5001628A
Cited
US5151989A
Cited
US5175852A
Cited
US5129082A
Cited
US5202982A
Cited
US5032979A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-04-04 | 1997-10-04 | 1998-04-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-04-04 | 2001-10-04 | 2002-04-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-04-04 | 2005-10-04 | 2006-04-05 | $7700.00 | Window Closed / Lapsed |