Universally Unique Identifier

From Wikipedia, the free encyclopedia

A Universally Unique Identifier (UUID) is an identifier standard used in software construction, standardized by the Open Software Foundation (OSF) as part of the Distributed Computing Environment (DCE). The intent of UUIDs is to enable distributed systems to uniquely identify information without significant central coordination. Thus, anyone can create a UUID and use it to identify something with reasonable confidence that the identifier will never be unintentionally used by anyone for anything else. Information labeled with UUIDs can therefore be later combined into a single database without needing to resolve name conflicts. The most widespread use of this standard is in Microsoft's Globally Unique Identifiers (GUIDs). Other significant users include Linux's ext2/ext3 filesystem, LUKS encrypted partitions, GNOME, KDE, and Mac OS X, all of which use implementations derived from the uuid library found in the e2fsprogs package.

UUIDs are documented as part of ISO/IEC 11578:1996 "Information technology -- Open Systems Interconnection -- Remote Procedure Call (RPC)" and more recently in ITU-T Rec. X.667 | ISO/IEC 9834-8:2005 (freely available). The IETF has published Proposed Standard RFC 4122 that is technically equivalent with ITU-T Rec. X.667 | ISO/IEC 9834-8.

Contents

[edit] Definition

A UUID is a 16-byte (128-bit) number. The number of theoretically possible UUIDs is therefore 216*8 = 2128 = 25616 or about 3.4 × 1038. This means that 1 trillion UUIDs would have to be created every nanosecond for 10 billion years to exhaust the number of UUIDs.

In its canonical form, a UUID consists of 32 hexadecimal digits, displayed in 5 groups separated by hyphens, in the form 8-4-4-4-12 for a total of 36 characters. For example:

550e8400-e29b-41d4-a716-446655440000

A UUID may also be used with a specific identifier intentionally used repeatedly to identify the same thing in different contexts. For example, in Microsoft's Component Object Model, every component must implement the IUnknown interface, which is done by creating a UUID representing IUnknown. In all cases wherever IUnknown is used, whether it is being used by a process trying to access the IUnknown interface in a component, or by a component implementing the IUnknown interface, it is always referenced by the same identifier: 00000000-0000-0000-C000-000000000046.

[edit] Version 1 (MAC address)

Conceptually, the original (version 1) generation scheme for UUIDs was to concatenate the UUID version with the MAC address of the computer that is generating the UUID, and with the number of 100-nanosecond intervals since the adoption of the Gregorian calendar. In practice, the actual algorithm is more complicated. This scheme has been criticized in that it is not sufficiently 'opaque'; it reveals both the identity of the computer that generated the UUID and the time at which it did so.

[edit] Version 2 (DCE Security)

Version 2 UUIDs are similar to Version 1 UUIDs, with the upper byte of the clock sequence replaced by the identifier for a "local domain" (typically either the "POSIX UID domain" or the "POSIX GID domain") and the first 4 bytes of the timestamp replaced by the user's POSIX UID or GID (with the "local domain" identifier indicating which it is).[1][2]

[edit] Version 3 (MD5 hash)

Version 3 UUIDs use a scheme deriving a UUID via MD5 from a URL, a fully qualified domain name, an Object identifier, a distinguished name (DN as used in Lightweight Directory Access Protocol), or on names in unspecified namespaces. Version 3 UUIDs have the form xxxxxxxx-xxxx-3xxx-xxxx-xxxxxxxxxxxx with hexadecimal digits x.

To determine the version 3 UUID of a given name the UUID of the namespace, e.g. 6ba7b810-9dad-11d1-80b4-00c04fd430c8 for a domain, is transformed to a string of bytes corresponding to its hexadecimal digits, concatenated with the input name, hashed with MD5 yielding 128 bits. Six bits are replaced by fixed values, four of these bits indicate the version, 0011 for version 3. Finally the fixed hash is transformed back into the hexadecimal form with hyphens separating the parts relevant in other UUID versions.

[edit] Version 4 (random)

 Please help improve this article or section by expanding it.
Further information might be found on the talk page or at requests for expansion. (January 2007)

Version 4 UUIDs use a scheme relying only on random numbers.

[edit] Version 5 (SHA-1 hash)

Version 5 UUIDs use a scheme with SHA-1 hashing, otherwise it is the same idea as in version 3. RFC 4122 states that version 5 is preferred over version 3 name based UUIDs.

[edit] Implementations

[edit] Borland Developer Studio

A new GUID can be generated by pressing Ctrl-Shift-G.

[edit] C

libuuid is part of the e2fsprogs package and is available from http://e2fsprogs.sourceforge.net/.

The OSSP project provides a UUID library.[3]

[edit] Cocoa/Carbon

The Core Foundation class CFUUIDRef is used to produce and store UUIDs, as well as to convert them to and from CFString/NSString representations.[4]

[edit] ColdFusion

The createUUID() function provides a UUID in all versions, however the format generated is in 4 segments instead of 5 xxxxxxxx-xxxx-xxxx-xxxxxxxxxxxxxxxx (8-4-4-16).[5]

[edit] Common Lisp

A library is available to create UUIDs (v1, v3, v4 and v5) according to RFC 4122.[6]

[edit] Free Pascal & Lazarus IDE

In Free Pascal there is a class called TGUID that holds the structure of a UUID. Also in the SysUtils.pas unit there are methods to create, compare and convert UUID's. They are CreateGUID(), GUIDToString() and IsEqualGUID().[7] In the Lazarus IDE you can also generate a UUID by pressing Ctrl+Shift+G.

[edit] Haskell

The package uuid[8] provides a binding to library libuuid, which is part of e2fsprogs.[9] The package can be used to create, parse, and print UUIDs.

[edit] Java

The J2SE 5.0 release of Java provides a class that will produce 128-bit UUIDs, although it only implements version 3 and 4 generation methods, not the original method (due to lack of means to access MAC addresses using pure Java). The API documentation for the java.util.UUID class refers to ISO/IEC 11578:1996.

Open source implementations supporting MAC addresses on several common operating systems are UUID – generate UUIDs (or GUIDs) in Java , Java Uuid Generator (JUG) and ActiveScript [1].

[edit] Javascript

AF Design provide a javascript class based on random number instead of MAC address.

[edit] MySQL

MySQL provides a UUID() function.[10]

[edit] .NET Framework

The .NET Framework also provides a class called System.Guid to generate and manipulate 128-bit UUIDs. [2]

[edit] ORACLE Database

The Oracle SQL provides a function called SYS_GUID() to generate unique identifiers ([3]).

[edit] Perl

The Data::UUID[11] module from CPAN can be used to create UUIDs

[edit] PHP

In PHP there are several modules for creating UUIDs. [4]

[edit] Postgresql

Postgresql contains a uuid data type. Also various generation functions as part of the uuid-ossp contrib module.[12]

[edit] Progress OpenEdge ABL

The GENERATE-UUID function in OpenEdge 10 provides a UUID which can be made printable using the GUID() or BASE64-ENCODE() functions. [5]

[edit] Python

The uuid module[13] (included in the standard library since Python 2.5) creates UUIDs to RFC 4122.

[edit] Ruby

There are several RFC4122 implementations for Ruby, the most updated ones being Ruby-UUID and UUID

[edit] SQL Server Data Base

Transact-SQL (2000 and 2005) provides a function called NEWID() to generate uniqueidentifiers.

[edit] Tcl

A Tcl implementation is provided in the TclLib package.[14]

[edit] Random UUID probability of duplicates

Randomly generated UUIDs like those generated by the java.util.UUID class have 122 random bits. There are 128 bits altogether with 4 bits being used for the version ('Randomly generated UUID'), and 2 bits for the variant ('Leach-Salz'). With random UUIDs, the chance of two having the same value can be calculated using probability theory (Birthday paradox). Using the approximation

p(n)\approx 1-e^{-n^2/{2 \cdot x}}

these are the probabilities of an accidental clash after calculating n UUIDs, with x=2122:

n probability
68,719,476,736 = 236 0.0000000000000004 (4 x 10-16)
2,199,023,255,552 = 241 0.0000000000004 (4 x 10-13)
70,368,744,177,664 = 246 0.0000000004 (4 x 10-10)

To help non-mathematicians understand what those numbers mean, here's a comparison: One's annual risk of being hit by a meteorite is estimated to be one chance in 17 billion [15], that means the probability is about 0.00000000006 (6 x 10-11), equivalent to the odds of creating a few tens of trillions of UUIDs in a year and having one duplicate. In other words, only after generating 1 billion UUIDs every second for the next 100 years, the probability of creating just one duplicate would be about 50%. The probability of one duplicate would be about 50% if every person on earth owns 600 million UUIDs.

The odds of a properly generated duplicate UUID being used in error in any practical circumstance is so low that any other work to improve software reliability would clearly be a much higher priority.

The probability also depends on the quality of the random number generator. A cryptographically secure pseudorandom number generator must be used to generate the values, otherwise the probability of duplicates may be significantly higher.

[edit] References

  1. ^ The Open Group (1997). CDE 1.1: Remote Procedure Call.
  2. ^ The Open Group (1997). DCE 1.1: Authentication and Security Services.
  3. ^ Open Source Software Project. Universally Unique Identifier (UUID).
  4. ^ Apple Computer, Inc.. CFUUID Reference.
  5. ^ Adobe Systems Inc.. ColdFusion Functions:CreateUUID.
  6. ^ Boian Tzonev. UUID.
  7. ^ Free Pascal Documentation. Reference for 'sysutils' unit.
  8. ^ Antoine Latter. uuid.
  9. ^ Theodore Ts'o. e2fsprogs esfsprogs.
  10. ^ MySQL AB. MySQL 5.0 Reference Manual.
  11. ^ Ricardo Signes. Data-UUID.
  12. ^ PostgreSQL Global Development Group. PostgreSQL 8.3.x Documentation: UUID Type.
  13. ^ Python Library Reference: uuid.
  14. ^ Tcl Standard Library: uuid.
  15. ^ Old Farmer's Almanac 1994, 220-222, Taking your Chances: An Explanation of Risk

[edit] See also

[edit] External links