Browse Prior Art Database

# Method for Sequential Identifier Generation Beyond Architected Limits

IP.com Disclosure Number: IPCOM000117533D
Original Publication Date: 1996-Mar-01
Included in the Prior Art Database: 2005-Mar-31
Document File: 2 page(s) / 59K

IBM

## Related People

Gresham, MC: AUTHOR [+1]

## Abstract

An algorithm for generating sequential identifiers based on MOD 36 arithmetic which is used to bypass database restrictions and architected limits.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Method for Sequential Identifier Generation Beyond Architected Limits

An algorithm for generating sequential identifiers based on MOD
36 arithmetic which is used to bypass database restrictions and
architected limits.

Disclosed is an algorithm for generating sequential identifiers
beyond the architected limits.  It is based on MOD 36 arithmetic for
identifier naming which is not new.  However, new value is added when
the algorithm is used to avoid database restrictions and architected
limits.

The algorithm is based on MOD 36 arithmetic but another number
other than 36 can be chosen, if desired.  The algorithm gives out
identifiers similar to how sequential identifiers would be given out
using the numbers 0-9.  Instead, however, each digit can be 0-9
followed by A-Z, representing a MOD 36 value.  These values are kept
in a string format rather than an integer, since an integer won't
support anything other than 0-9 and data representation of the
integer can't exceed eight bytes.

The algorithm itself uses the index values of a set of
characters to determine the next possible value in a MOD 36 sequence.
0  1  2  . . . 9  10  11 12 . . .  32  33  34  35
0  1  2  . . . 9   A   B  C . . .   W   X   Y   Z

Therefore, if a string representation of the MOD 36 number is
AXYZ (10|33|34|35), the index representation of the next value would
be |10|33|35|0| and the value would be AXZ0.  All names gene...