Directory partitioned system and method

• US 9,935,919 B2
• Filed: 01/09/2009
• Issued: 04/03/2018
• Est. Priority Date: 02/25/2008
• Status: Active Grant

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Harvey, Richard H., McDonald, Justin J., Ramsay, Ronald W.
• Primary Examiner(s): Mahmoudi, Tony
• Assistant Examiner(s): Black, Linh
• Application Number:
  US12/351,300
• Publication Number:
  US 20090216723A1
• Time in Patent Office: 3,371 Days
• Field of Search: 707736-738, 707758
• CPC Class Codes: H04L 61/4523 using lightweight directory access protocol [LDAP]
• CPC Class Codes: H04L 61/4552 Lookup mechanisms between a plurality of directories; Synchronisation of directories, e.g. metadirectories

Abstract

This disclosure relates in general to the field of directory information systems and/or services. In a method embodiment, a method of arranging objects in a directory information system includes providing a plurality of objects to a computer-readable medium having a directory information structure. Each object may have one or more characteristics and each object may be stored, for example, in the computer-readable medium according to the directory information structure. Storing the objects may further include performing a mathematic operation on at least one of the characteristic(s) of the object, and arranging the object in the directory information structure based at least in part on a result of the mathematical operation performed on at least one of the characteristic(s) of the object.

Claims

1. A method of searching and updating a directory information system, the method comprising:

receiving, by a directory server, a request from a client to perform an operation on a base object within the directory information system, the directory information system comprising a plurality of objects distributed among a plurality of partitions, each partition of the plurality of partitions subordinate to a parent node of the plurality of parent nodes, the request comprising a label identifying the name of the base object with the partitions being invisible to the client and at least one or more one or more attribute values of the base object selected from the group consisting of;

a globally unique identifier;

an identifier unique with respect to a plurality of sibling directory objects of the plurality of directory objects, the plurality of sibling directory objects having a parent in common; and

an email address;

applying, by the directory server, a mathematical operation to the name of the base object to result in a positive integer outcome;

determining, by the directory server, that a first partition of the plurality of partitions is associated with the positive integer outcome calculated, at least in part, by applying the mathematical operation to the name of the base object; and

routing, by the directory server, the operation to the first partition without client interaction.

2. The method of claim 1, wherein the mathematical operation performed on at least one of the one or more characteristics of the object comprises a hash function.

3. The method of claim 1, wherein the mathematical operation performed on at least one of the one or more characteristics of the object comprises an equation function(characteristic) modulus N=result, and wherein

the function is a first mathematical operation producing a positive integer outcome;

the characteristic is at least one of the one or more characteristics of the object;

the N is a total number of the plurality of partitions; and

the result is a value assigned to one or more of the plurality of partitions.

4. A method as claimed in claim 3, wherein the first mathematical operation comprises one or more functions selected from the list consisting of:

a checksum;

a cryptographic hash;

a numeric sum; and

a hash table.

5. The method of claim 3, wherein the first mathematical operation comprises a non-linear function.

6. The method of claim 1, wherein the plurality of objects comprises a first object and a second object, the first object of the plurality of objects subordinate to the second object of the plurality of objects.

7. The method of claim 1, further comprising searching at least a subset of the plurality of partitions for the base object.

8. A directory information system comprising:

one or more servers comprising computer-readable media divided into a plurality of partitions, each partition subordinate to a first parent node of a plurality of parent nodes; and

a plurality of objects stored in the computer-readable media of the one or more servers, each object arranged in a respective partition of the plurality of partitions in accordance with a respective positive integer result of a mathematical operation applied to one or more characteristics of the object, the positive integer result identifying the respective partition of the plurality of partitions, and

wherein the one or more servers are operable to;

receive a request for an operation to be performed on a base object within the plurality of objects, the request identifying the name of the base object with the partitions being invisible to the client and at least one or more one or more attribute values of the base object selected from the group consisting of;

a globally unique identifier;

an identifier unique with respect to a plurality of sibling directory objects of the plurality of directory objects, the plurality of sibling directory objects having a parent in common; and

an email address;

apply a mathematical operation to the name of the base object to result in a positive integer outcome;

determine that a first partition of the plurality of partitions is associated with the positive integer outcome calculated, at least in part, by applying the mathematical operation to the name of the base object;

route the operation to the first partition without client interaction.

9. The directory information system of claim 8, wherein a first object of the plurality of objects is arranged, in the respective partition, subordinate to a second object of the plurality of objects.

10. The directory information system of claim 8, wherein the mathematical operation comprises a hash function.

11. The directory information system of claim 8, wherein the mathematical operation comprises a non-linear function.

12. The directory information system of claim 8, wherein the mathematical operation applied to the one or more characteristics of the object, comprises an equation function(characteristic) modulus N=result, and wherein

the function is a first mathematical operation producing a positive integer outcome;

the characteristic is at least one of the one or more characteristics of the object;

the N is a total number of the plurality of partitions; and

the result is a value assigned to one or more of the plurality of partitions.

13. The directory information system of claim 8, wherein at least two objects of the plurality of objects are distributed within a first partition of the plurality of partitions based at least in part on at least two of the respective results generated by the first mathematical operation, the at least two of the respective results substantially the same.

14. The directory information system of claim 8, further comprising logic embodied in a computer-readable medium and operable, when executed, to:

determine a name of a first object of the plurality of objects;

determine a first partition of the one or more partitions contains the first object, at least in part, by applying the mathematical operation to at least one of the one or more characteristics of the first object; and

route the operation to a first server of the one or more servers, the first server operable to manage the first partition.

15. The directory information system of claim 8, further comprising logic embodied in computer-readable medium and operable, when executed, to search at least a subset of the one or more partitions for a first object of the plurality of objects.

16. The directory information system of claim 8, further comprising logic embodied in computer-readable medium and operable, when executed, to:

determine a first partition of the plurality of partitions;

determine a second partition of the plurality of partitions shares the same parent node of the one or more parent nodes with the first partition of the plurality of partitions; and

search the second partition of the plurality of partitions for a first object of the plurality of objects.