System and method for index processing

• US 8,156,079 B1
• Filed: 06/30/2005
• Issued: 04/10/2012
• Est. Priority Date: 06/30/2005
• Status: Expired due to Fees

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Ozekinci, Yasemin Ugur, Papadakis, Thomas
• Primary Examiner(s): Timblin, Robert
• Assistant Examiner(s): REYES, MARIELA D
• Application Number:
  US11/174,070
• Time in Patent Office: 2,476 Days
• Field of Search: 707/640, 707/648
• US Class Current: 707/640
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06

Abstract

A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises concatenating at least a portion of the name of each object being stored into a hint; and storing the hint in an index. The portion of the name is the entire name, the first n characters, the last n characters, or every nth character, and this may be selected based on the application associated with the objects. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Claims

1. A method of tracking a plurality of objects being stored, comprising:

applying a search optimization algorithm to the name of each of the plurality of objects being stored to generate a name value for each of the plurality of objects comprising at least a portion of each name for each of the plurality of objects;

concatenating the name values of each of the plurality of objects into a hint, wherein the hint comprises a single value formed by appending the name values of each of the plurality of objects end to end;

associating the plurality of objects with a saveset;

associating the hint with the saveset;

storing the hint in an index, wherein the index comprises a savepoint configured to store information about a longest pathname containing the plurality of objects;

wherein concatenating at least a portion of a name of each object into the hint includes selecting a portion of the name of each object; and

wherein the name of each object comprises characters, and selecting a portion of the name of each object includes selecting the first n characters of the name of each object.

2. The method as recited in claim 1, further comprising storing in the index a longest pathname containing the plurality of objects.

3. The method as recited in claim 1, wherein the index comprises descriptors for a plurality of savesets.

4. The method as recited in claim 3, wherein storing the hint includes storing the hint in one of the descriptors.

5. The method as recited in claim 1, wherein storing the hint includes storing the hint in the savepoint.

6. The method as recited in claim 1, wherein concatenating at least a portion of a name of each object into the hint includes concatenating the name of each object into the hint.

7. The method as recited in claim 1, further comprising determining n by dividing a number of the objects in the plurality of the objects into a total space available for storing the hint.

8. The method as recited in claim 1, wherein the name of each object comprises characters, and selecting a portion of the name of each object includes selecting the last n characters of the name of each object.

9. The method as recited in claim 1, wherein the name of each object comprises characters, and selecting a portion of the name of each object includes selecting every nth character of the name of each object.

10. The method as recited in claim 9, wherein selecting a portion of the name of each object includes selecting every nth character of the name of each object up to m characters, and further comprising determining m by dividing a number of the objects in the plurality of the objects into a total space available for storing the hint.

11. The method as recited in claim 1, further comprising determining the portion of the name of each object based on an application associated with the object.

12. The method as recited in claim 11, wherein the application is a database.

13. A computer program product for tracking a plurality of objects being stored, comprising a computer usable storage medium having machine readable code embodied therein for:

applying a search optimization algorithm to the name of each of the plurality of objects being stored to generate a name value for each of the plurality of objects comprising at least a portion of each name for each of the plurality of objects;

concatenating the name values of each of the plurality of objects into a hint, wherein the hint comprises a single value formed by appending the name values of each of the plurality of objects end to end;

associating the plurality of objects with a saveset;

associating the hint with the saveset;

storing the hint in an index, wherein the index comprises a savepoint configured to store information about a longest pathname containing the plurality of objects;

wherein concatenating at least a portion of a name of each object into the hint includes selecting a portion of the name of each object; and

wherein the name of each object comprises characters, and selecting a portion of the name of each object includes selecting the first n characters of the name of each object.