Browse Prior Art Database

hashing algorithm Disclosure Number: IPCOM000016244D
Original Publication Date: 2002-Sep-30
Included in the Prior Art Database: 2003-Jun-21

Publishing Venue



Disclosed is a simple way to build hashing algorithm for alphanumeric strings and similar. The procedure is divided into two steps: first of all it transforms each string into an only-numeric array (step1), then it uses whatever hashing algorithm for numeric arrays. It could be useful in inventory processing. Step 1 If A is a set of symbols (here called, for simplicity, an alphabet) and a is a function a: A N 4 {0} which associates to each symbol g c A a positive integer n c N 4 {0}, it is possible to define a correspondence c between an array v c V a Z ...( t times, t c N ... Z (where V is the cartesian product of whatever combination of A and N 4 {0}) and N 4 {0} N 4 {0} ... N 4 {0} a Z ...(m times, m c N, t m m ... Z in this way: c : V N 4 {0} N 4 {0} ... N 4 {0}