File location naming hierarchy

• US 7,882,147 B2
• Filed: 12/06/2004
• Issued: 02/01/2011
• Est. Priority Date: 06/30/2004
• Status: Expired due to Fees

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.), Virginia T. Jenkins
• Original Assignee: Robert T. Jenkins, Virginia T. Jenkins
• Inventors: LeTourneau, Jack J.
• Primary Examiner(s): ROBINSON, GRETA LEE
• Application Number:
  US11/006,320
• Publication Number:
  US 20060015538A1
• Time in Patent Office: 2,248 Days
• Field of Search: 707/100, 707/200, 707/205, 707/1, 707/10, 707/101, 707/102, 707/103.X, 707/103.Y, 707/103.Z, 707/103.R, 707/104.1, 707/790, 707/793, 707/795, 707/796, 707/802, 707/803, 707/829, 707/828, 707/756, 707/953, 707/956, 707/999.1, 707/999.101, 707/999.2, 707/778
• US Class Current: 707/803
• CPC Class Codes: G06F 16/10 File systems; File servers

Abstract

Embodiments of methods, apparatuses, devices and/or systems for a file location naming hierarchy are disclosed.

Claims

1. An article comprising:

a memory having stored thereon a file;

said file having a named location;

said named location being part of a binary tree file location naming hierarchy at least formed from a finite multi-set by;

an association of said finite multi-set with a natural numeral; and

an association of a first non-composite numeral and a second non-composite numeral with said natural numeral, said non-composite numerals and said finite multi-set forming at least a portion of said hierarchy.

2. The article of claim 1, wherein said file location naming hierarchy is further formed by:

said finite multi-set representing a named location for a file in said hierarchy, and said first and second non-composite numerals representing additional named locations for related files in said hierarchy.

3. The article of claim 1, wherein said file location naming hierarchy is further formed by:

an association of a plurality of binary trees with finite multi-sets, each binary tree associated with a finite multi-set further associated with two or more natural numerals larger than one.

4. An apparatus comprising:

a processor;

said processor being adapted to form a binary tree file location naming hierarchy from a finite multi-set as follows;

associating said finite multi-set with a natural numeral;

associating a first non-composite numeral and a second non-composite numeral with said natural numeral, said non-composite numerals and said finite multi-set forming at least a portion of said hierarchy.

5. The apparatus of claim 4, wherein said processor being further adapted to represent a named location for a file in said hierarchy with said finite multi-set, and to represent additional named locations for related files in said hierarchy with said first and second non-composite numerals.

6. The apparatus of claim 4, wherein said processor is further adapted to associate a plurality of number of binary trees with finite multi-sets, each binary tree associated with a finite multi-set further associated with two or more natural numerals larger than one.