Method and apparatus for generating location independent unique identifiers

• US 8,117,443 B1
• Filed: 10/05/2005
• Issued: 02/14/2012
• Est. Priority Date: 10/05/2005
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Oracle America, Inc. (Oracle Corporation)
• Inventors: Waldo, James H., Blackman, Timothy, Sproull, Robert
• Primary Examiner(s): Cervetti, David Garcia
• Application Number:
  US11/243,892
• Time in Patent Office: 2,323 Days
• Field of Search: 713/167, 707/1, 707/10, 707/100
• US Class Current: 713/167
• CPC Class Codes: H04L 2101/604 Address structures or formats
• CPC Class Codes: H04L 61/5092 by self-assignment, e.g. picking addresses at random and testing if they are already in use

Abstract

Universal Unique Identifiers (UUIDs) are generated using a variety of algorithms and these algorithms are themselves encoded into the UUID. Each UUID includes two parts: a first part that is an identifier, which is unique to the second part. The second part identifies the algorithm that was used to generate the identifier. Thus, the uniqueness of the identifier is based on how the identifier was created not the entity that created it. The identity of two UUIDs is determined by comparing both the generator algorithm ID and the relative ID.

Claims

1. A method for use in a computer having a processor and a memory that generates location independent unique identifiers in the memory and comprises:

(a) controlling the processor with a generator algorithm to generate a relative identifier that is unique relative to that algorithm;

(b) generating a generator algorithm identifier that probabilistically uniquely identifies the generator algorithm that is used in step (a), wherein when the generator algorithm is an unregistered generator algorithm, generating the generator algorithm identifier includes hashing a class name of the generator algorithm and using the resulting hash as the generator algorithm identifier; and

(c) controlling the processor to form a probabilistically unique identifier in the memory from the relative identifier and the generator algorithm identifier;

wherein step (a) comprises selecting as the generator algorithm, an algorithm that is used in a medical system to identify patients.

2. The method of claim 1 wherein step (a) comprises selecting the generator algorithm from a set of pre-defined generator algorithms.

3. The method of claim 1 wherein the generator algorithm generates an array of bytes in the memory.

4. The method of claim 1 wherein step (b) comprises registering the generator algorithm with a central authority and using the central authority to generate the generator algorithm identifier.

5. The method of claim 1 wherein step (c) comprises constructing in the memory an object that includes the generator algorithm identifier and the relative identifier.

6. The method of claim 5 wherein step (c) further comprises using an interface to define the object.

7. The method of claim 1 further comprising:

(d) generating two unique identifiers in the memory; and

(e) determining the identity of the two unique identifiers by comparing the generator algorithm identifiers in each of the two unique identifiers and comparing the relative identifiers in the two unique identifiers.

8. A tangible non-transitory computer-usable medium for storing data for access by a program executing on a data processing system, comprising a data structure that acts as a UUID including:

a relative identifier that is generated by a generator algorithm and is unique relative to that generator algorithm; and

a generator algorithm identifier that probabilistically uniquely identifies the generator algorithm, wherein when the generator algorithm is an unregistered generator algorithm, the generator algorithm identifier includes a resulting hash from hashing a class name of the generator algorithm.

9. The tangible computer-usable medium of claim 8 wherein the relative identifier comprises an array of bytes.

10. The tangible computer-usable medium of claim 8 wherein the generator algorithm is registered with a central authority and the central authority generates the generator algorithm identifier.

11. The tangible computer-usable medium of claim 8 wherein the data structure is an object that includes the generator algorithm identifier and the relative identifier.

12. The tangible computer-usable medium of claim 11 wherein the object is defined by an interface.

13. A computer program product for use in a computer having a processor and a memory that generates location independent unique identifiers in the memory and comprises a computer usable non-transitory tangible medium having computer readable program code fixed thereon, including:

generator algorithm code that generates a relative identifier that is unique relative to that algorithm;

program code for providing a generator algorithm identifier that probabilistically uniquely identifies the generator algorithm used by the generator algorithm code, wherein when the generator algorithm is an unregistered generator algorithm, providing the generator algorithm identifier includes hashing a class name of the generator algorithm and using the resulting hash as the generator algorithm identifier; and

program code for forming a probabilistically unique identifier in the memory from the relative identifier and the generator algorithm identifier.