SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR GENERATING CHRONOLOGICALLY ORDERED GLOBALLY UNIQUE IDENTIFIERS
First Claim
Patent Images
1. A computer implemented method of generating a plurality of universally unique identifiers (“
- UUIDs”
) each of the plurality of UUIDs comprising a plurality of bits arranged in order from a most significant bit to a least significant bit, and for each of the plurality of UUIDs, the method comprises;
generating, via a computer processor, a time value, wherein the time value represents a current time of a computer associated with the computer processor;
setting a plurality of the more significant bits of the UUID to the time value;
setting a plurality of the less significant bits of the UUID to a random number; and
storing the UUID in a memory.
10 Assignments
0 Petitions
Accused Products
Abstract
A computer-based system, method and computer program product for generating chronologically based globally unique identifiers.
26 Citations
42 Claims
-
1. A computer implemented method of generating a plurality of universally unique identifiers (“
- UUIDs”
) each of the plurality of UUIDs comprising a plurality of bits arranged in order from a most significant bit to a least significant bit, and for each of the plurality of UUIDs, the method comprises;generating, via a computer processor, a time value, wherein the time value represents a current time of a computer associated with the computer processor; setting a plurality of the more significant bits of the UUID to the time value; setting a plurality of the less significant bits of the UUID to a random number; and storing the UUID in a memory. - View Dependent Claims (2, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
- UUIDs”
-
3. (canceled)
-
5. (canceled)
-
17. A computer implemented method of generating a plurality of universally unique identifiers (“
- UUIDs”
), each of the plurality of UUIDs comprising a plurality of bits arranged in order from a most significant bit to a least significant bit, and for each of the plurality of UUIDs, the method comprises;generating, via a computer processor, a time value, wherein the time value represents a current time of a computer associated with the computer processor, and the time value has a faster changing portion and a slower changing portion; setting a first portion of the bits of the UUID to the slower changing portion of the time value, and setting a second portion of the bits of the UUID to faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are proximate the first portion of the bits of the UUID and comprising less significant bits of the UUID than the first portion of the bits of the UUID, and setting a third portion of the bits of the UUID that are less significant than the second portion of the bits of the UUID to a random number; and storing the UUID in a memory. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26)
- UUIDs”
-
18-19. -19. (canceled)
-
27. A computer program product comprising a non-transitory computer readable medium for generating a plurality of universally unique identifiers (“
- UUIDs”
), each of the plurality of UUIDs comprising a plurality of bits arranged in order from left to right, with more significant bits on the left and less significant bits on the right, the computer readable medium comprising program instructions which, when executed by a computer processor, for each of the plurality of UUIDs, will cause the computer processor togenerate a time value, wherein the time value represents a current time of a computer associated with the computer processor; set a plurality of the more significant bits of the UUID to the time value; set a plurality of the less significant bits of the UUID to a random number; and store the UUID in a memory.
- UUIDs”
-
28-30. -30. (canceled)
-
31. A computer program product comprising a non-transitory computer readable medium for generating universally unique identifiers (“
- UUIDs”
), each of the UUIDs comprising a plurality of bits arranged in order from left to right, with more significant bits on the left and less significant bits on the right, the computer readable medium comprising program instructions which, when executed by a computer processor, for each of the plurality of UUIDs, will cause the processor to;generate a time value, wherein the time value represents a current time of a computer associated with the computer processor, and the time value has a faster changing portion and a slower changing portion; set a first portion of the more significant bits of the UUID to the slower changing portion of the time value, and set a second portion of the more significant bits of the UUID to the faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are proximate the first portion of the more significant bits of the UUID, and between first portion of the more significant bits of the UUID and less significant bits of the UUID; set a plurality of the less significant bits of the UUID to a random number; and store the UUID in a memory.
- UUIDs”
-
32-33. -33. (canceled)
-
34. A non-transitory computer readable medium comprising a data structure, which is usable by a program executable on a computer system, for a universally unique identifier (“
- UUID”
) comprising;a plurality of bits arranged from left to right, with more significant bits on the left and less significant bits on the right; at least some of the more significant bits of the UUID being set to a time value; and at least some of the less significant bits of the UUID being set to a random number.
- UUID”
-
35. A non-transitory computer readable medium comprising a data structure, which is usable by a program executable on a computer system, for a universally unique identifier (“
- UUID”
) comprising;a plurality of bits arranged from left to right, with more significant bits on the left and less significant bits on the right; a first portion of the more significant bits of the UUID being set to a slower changing portion of a time value and a second portion of the more significant bits of the UUID being set to a faster changing portion of the time value, wherein the second portion of the more significant bits of the UUID are proximate the first portion of the more significant bits of the UUID, and between the first portion of the more significant bits of the UUID and the less significant bits of the UUID; and a plurality of the less significant bits of the UUID being set to a random number.
- UUID”
-
36. A computer implemented method of generating a universally unique identifier (“
- UUID”
) that comprises a plurality of bits that are arranged in a plurality of fields, each field including one or more of the plurality of bits, the method comprising;using a processor to generate a time value that represents a current time; setting a first field that includes the most significant bits of the UUID to the time value; setting a second field of the UUID to a random number; and storing the UUID in a memory. - View Dependent Claims (37, 38, 39, 40, 41, 42)
- UUID”
Specification